./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-3061b6d-m [2024-11-19 14:14:51,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:14:51,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:14:51,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:14:51,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:14:51,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:14:51,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:14:51,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:14:51,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:14:51,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:14:51,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:14:51,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:14:51,184 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:14:51,185 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:14:51,185 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:14:51,189 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:14:51,189 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:14:51,190 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:14:51,190 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:14:51,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:14:51,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:14:51,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:14:51,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:14:51,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:14:51,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:14:51,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:14:51,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:14:51,192 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:14:51,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:14:51,193 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:14:51,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:14:51,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:14:51,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:14:51,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:14:51,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:14:51,195 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:14:51,196 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-19 14:14:51,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:14:51,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:14:51,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:14:51,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:14:51,490 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:14:51,492 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-19 14:14:52,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:14:53,176 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:14:53,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2024-11-19 14:14:53,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc213f90/003cd7d8b4ce41ab891d349acca65ef2/FLAG5bd8682ad [2024-11-19 14:14:53,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dc213f90/003cd7d8b4ce41ab891d349acca65ef2 [2024-11-19 14:14:53,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:14:53,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:14:53,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:14:53,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:14:53,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:14:53,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:14:53" (1/1) ... [2024-11-19 14:14:53,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2741bfb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53, skipping insertion in model container [2024-11-19 14:14:53,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:14:53" (1/1) ... [2024-11-19 14:14:53,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:14:53,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:14:53,809 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:14:53,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:14:53,836 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:14:53,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53 WrapperNode [2024-11-19 14:14:53,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:14:53,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:14:53,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:14:53,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:14:53,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53" (1/1) ... [2024-11-19 14:14:53,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53" (1/1) ... [2024-11-19 14:14:53,872 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2024-11-19 14:14:53,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:14:53,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:14:53,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:14:53,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:14:53,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53" (1/1) ... [2024-11-19 14:14:53,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53" (1/1) ... [2024-11-19 14:14:53,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53" (1/1) ... [2024-11-19 14:14:53,896 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 14:14:53,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53" (1/1) ... [2024-11-19 14:14:53,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53" (1/1) ... [2024-11-19 14:14:53,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53" (1/1) ... [2024-11-19 14:14:53,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53" (1/1) ... [2024-11-19 14:14:53,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53" (1/1) ... [2024-11-19 14:14:53,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53" (1/1) ... [2024-11-19 14:14:53,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:14:53,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:14:53,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:14:53,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:14:53,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53" (1/1) ... [2024-11-19 14:14:53,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:53,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:53,945 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-19 14:14:53,949 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-19 14:14:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2024-11-19 14:14:54,000 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2024-11-19 14:14:54,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:14:54,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:14:54,071 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:14:54,073 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:14:54,266 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-19 14:14:54,269 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:14:54,281 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:14:54,282 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 14:14:54,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:14:54 BoogieIcfgContainer [2024-11-19 14:14:54,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:14:54,283 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:14:54,283 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:14:54,286 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:14:54,287 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:14:54,287 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:14:53" (1/3) ... [2024-11-19 14:14:54,288 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2807c58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:14:54, skipping insertion in model container [2024-11-19 14:14:54,288 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:14:54,288 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:14:53" (2/3) ... [2024-11-19 14:14:54,288 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2807c58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:14:54, skipping insertion in model container [2024-11-19 14:14:54,288 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:14:54,288 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:14:54" (3/3) ... [2024-11-19 14:14:54,290 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2024-11-19 14:14:54,343 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:14:54,343 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:14:54,343 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:14:54,343 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:14:54,343 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:14:54,343 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:14:54,344 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:14:54,344 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:14:54,349 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-19 14:14:54,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-11-19 14:14:54,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:14:54,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:14:54,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:14:54,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:14:54,370 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:14:54,370 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-19 14:14:54,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-11-19 14:14:54,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:14:54,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:14:54,373 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:14:54,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:14:54,379 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-19 14:14:54,380 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-19 14:14:54,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:54,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2024-11-19 14:14:54,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:54,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362832653] [2024-11-19 14:14:54,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:54,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:54,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:14:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:54,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:14:54,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:54,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1792233, now seen corresponding path program 1 times [2024-11-19 14:14:54,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:54,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451902880] [2024-11-19 14:14:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:54,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:54,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:14:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:54,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:14:54,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash -15995056, now seen corresponding path program 1 times [2024-11-19 14:14:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:54,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868284474] [2024-11-19 14:14:54,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:54,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:14:54,616 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-19 14:14:54,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:14:54,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868284474] [2024-11-19 14:14:54,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868284474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:14:54,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:14:54,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:14:54,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933297608] [2024-11-19 14:14:54,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:14:54,688 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:14:54,688 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:14:54,688 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:14:54,689 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:14:54,689 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:14:54,689 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:54,689 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:14:54,689 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:14:54,689 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2024-11-19 14:14:54,689 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:14:54,690 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:14:54,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:54,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:54,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:54,772 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:14:54,773 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:14:54,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:54,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:54,777 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-19 14:14:54,780 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-19 14:14:54,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:14:54,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:54,800 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:14:54,800 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-19 14:14:54,811 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-19 14:14:54,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:54,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:54,813 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-19 14:14:54,814 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-19 14:14:54,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:14:54,815 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:54,826 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:14:54,826 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-19 14:14:54,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-19 14:14:54,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:54,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:54,839 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-19 14:14:54,839 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-19 14:14:54,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:14:54,840 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:54,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-19 14:14:54,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:54,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:54,865 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-19 14:14:54,867 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-19 14:14:54,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:14:54,869 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:54,965 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:14:54,970 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-19 14:14:54,970 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:14:54,970 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:14:54,970 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:14:54,971 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:14:54,971 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:14:54,971 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:54,971 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:14:54,971 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:14:54,971 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2024-11-19 14:14:54,971 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:14:54,971 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:14:54,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:54,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:54,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:55,041 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:14:55,049 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:14:55,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:55,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:55,052 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-19 14:14:55,055 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-19 14:14:55,057 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-19 14:14:55,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:55,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:55,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:55,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:55,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:55,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:55,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:55,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:14:55,087 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-19 14:14:55,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:55,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:55,089 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-19 14:14:55,090 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-19 14:14:55,091 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-19 14:14:55,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:55,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:55,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:55,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:55,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:55,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:55,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:55,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:14:55,118 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-19 14:14:55,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:55,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:55,120 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-19 14:14:55,121 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-19 14:14:55,122 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-19 14:14:55,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:55,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:55,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:55,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:55,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:55,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:55,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:55,139 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:14:55,145 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-19 14:14:55,145 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-19 14:14:55,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:55,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:55,162 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:14:55,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:14:55,164 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:14:55,164 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:14:55,164 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:14:55,165 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-19 14:14:55,175 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-19 14:14:55,179 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:14:55,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:14:55,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:14:55,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:14:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:14:55,233 WARN L253 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:14:55,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:14:55,316 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-19 14:14:55,348 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-19 14:14:55,349 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-19 14:14:55,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 14:14:55,562 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-19 14:14:55,564 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-19 14:14:55,570 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-19 14:14:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2024-11-19 14:14:55,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-19 14:14:55,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:14:55,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-19 14:14:55,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:14:55,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 8 letters. [2024-11-19 14:14:55,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:14:55,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 107 transitions. [2024-11-19 14:14:55,582 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-11-19 14:14:55,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 35 states and 50 transitions. [2024-11-19 14:14:55,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-19 14:14:55,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-19 14:14:55,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 50 transitions. [2024-11-19 14:14:55,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:14:55,592 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 50 transitions. [2024-11-19 14:14:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 50 transitions. [2024-11-19 14:14:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-19 14:14:55,615 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-19 14:14:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2024-11-19 14:14:55,617 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2024-11-19 14:14:55,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:14:55,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:14:55,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:14:55,620 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-19 14:14:55,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:14:55,672 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-11-19 14:14:55,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2024-11-19 14:14:55,674 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-11-19 14:14:55,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 38 transitions. [2024-11-19 14:14:55,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-19 14:14:55,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-19 14:14:55,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2024-11-19 14:14:55,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:14:55,679 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-19 14:14:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2024-11-19 14:14:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-19 14:14:55,683 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-19 14:14:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-11-19 14:14:55,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-19 14:14:55,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:14:55,685 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-19 14:14:55,685 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:14:55,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2024-11-19 14:14:55,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-11-19 14:14:55,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:14:55,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:14:55,688 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:14:55,689 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-19 14:14:55,689 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-19 14:14:55,690 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-19 14:14:55,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2024-11-19 14:14:55,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:55,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967756296] [2024-11-19 14:14:55,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:14:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:55,699 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:14:55,699 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:14:55,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:14:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:55,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:14:55,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:55,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2022384732, now seen corresponding path program 1 times [2024-11-19 14:14:55,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:55,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032746129] [2024-11-19 14:14:55,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:55,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:14:55,943 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-19 14:14:55,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:14:55,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032746129] [2024-11-19 14:14:55,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032746129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:14:55,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:14:55,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 14:14:55,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321284525] [2024-11-19 14:14:55,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:14:55,944 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:14:55,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:14:55,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 14:14:55,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 14:14:55,945 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-19 14:14:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:14:56,031 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2024-11-19 14:14:56,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 43 transitions. [2024-11-19 14:14:56,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-11-19 14:14:56,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 43 transitions. [2024-11-19 14:14:56,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-19 14:14:56,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-19 14:14:56,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 43 transitions. [2024-11-19 14:14:56,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:14:56,037 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2024-11-19 14:14:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 43 transitions. [2024-11-19 14:14:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-19 14:14:56,040 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-19 14:14:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2024-11-19 14:14:56,044 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2024-11-19 14:14:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 14:14:56,046 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2024-11-19 14:14:56,046 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:14:56,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2024-11-19 14:14:56,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-11-19 14:14:56,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:14:56,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:14:56,048 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:14:56,048 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-19 14:14:56,048 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-19 14:14:56,051 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-19 14:14:56,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2024-11-19 14:14:56,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:56,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826829147] [2024-11-19 14:14:56,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:14:56,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:56,061 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:14:56,061 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:14:56,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:14:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:56,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:14:56,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:56,069 INFO L85 PathProgramCache]: Analyzing trace with hash 500720164, now seen corresponding path program 1 times [2024-11-19 14:14:56,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:56,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890231358] [2024-11-19 14:14:56,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:56,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 14:14:56,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [733989545] [2024-11-19 14:14:56,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:56,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:14:56,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:56,106 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-19 14:14:56,108 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-19 14:14:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:56,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:14:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:56,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:14:56,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:56,208 INFO L85 PathProgramCache]: Analyzing trace with hash -533252661, now seen corresponding path program 1 times [2024-11-19 14:14:56,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:56,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918643409] [2024-11-19 14:14:56,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:56,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:14:56,309 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-19 14:14:56,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:14:56,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918643409] [2024-11-19 14:14:56,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918643409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:14:56,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:14:56,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:14:56,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003952078] [2024-11-19 14:14:56,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:14:56,640 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:14:56,641 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:14:56,641 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:14:56,641 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:14:56,641 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:14:56,641 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:56,641 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:14:56,641 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:14:56,641 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2024-11-19 14:14:56,641 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:14:56,641 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:14:56,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,739 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:14:56,739 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:14:56,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:56,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:56,741 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-19 14:14:56,743 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-19 14:14:56,744 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:14:56,744 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:56,762 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:14:56,762 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-19 14:14:56,778 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-19 14:14:56,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:56,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:56,780 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-19 14:14:56,782 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-19 14:14:56,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:14:56,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:56,800 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:14:56,800 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-19 14:14:56,815 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-19 14:14:56,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:56,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:56,818 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-19 14:14:56,820 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-19 14:14:56,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:14:56,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:56,835 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:14:56,835 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-19 14:14:56,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-19 14:14:56,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:56,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:56,852 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-19 14:14:56,854 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-19 14:14:56,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:14:56,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:56,873 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:14:56,873 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-19 14:14:56,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-19 14:14:56,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:56,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:56,891 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-19 14:14:56,892 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-19 14:14:56,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:14:56,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:56,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-19 14:14:56,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:56,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:56,923 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-19 14:14:56,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 14:14:56,924 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:14:56,924 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:56,951 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:14:56,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-19 14:14:56,956 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:14:56,956 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:14:56,956 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:14:56,956 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:14:56,956 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:14:56,956 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:56,956 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:14:56,956 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:14:56,956 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2024-11-19 14:14:56,956 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:14:56,957 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:14:56,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:56,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:57,080 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:14:57,080 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:14:57,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:57,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:57,083 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-19 14:14:57,084 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-19 14:14:57,085 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-19 14:14:57,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:57,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:57,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:57,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:57,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:57,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:57,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:57,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:14:57,119 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-19 14:14:57,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:57,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:57,121 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-19 14:14:57,123 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-19 14:14:57,124 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-19 14:14:57,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:57,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:57,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:57,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:57,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:57,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:57,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:57,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:14:57,154 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-19 14:14:57,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:57,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:57,157 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-19 14:14:57,159 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-19 14:14:57,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:14:57,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:57,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:57,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:57,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:57,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:57,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:57,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:57,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:14:57,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-19 14:14:57,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:57,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:57,185 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-19 14:14:57,187 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-19 14:14:57,188 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-19 14:14:57,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:57,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:57,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:57,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:57,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:57,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:57,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:57,200 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:14:57,211 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-19 14:14:57,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:57,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:57,214 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:14:57,216 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-19 14:14:57,218 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-19 14:14:57,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:57,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:57,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:57,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:57,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:57,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:57,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:57,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:14:57,240 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-19 14:14:57,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:57,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:57,243 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:14:57,244 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-19 14:14:57,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-19 14:14:57,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:57,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:57,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:57,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:57,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:57,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:57,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:57,260 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:14:57,267 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:14:57,267 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:14:57,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:57,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:57,269 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-19 14:14:57,271 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-19 14:14:57,271 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:14:57,271 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:14:57,272 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:14:57,272 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-19 14:14:57,288 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-19 14:14:57,288 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:14:57,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:14:57,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:14:57,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:14:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:14:57,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 14:14:57,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:14:57,544 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-19 14:14:57,545 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-19 14:14:57,545 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-19 14:14:57,795 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-19 14:14:57,797 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-19 14:14:57,798 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-19 14:14:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-11-19 14:14:57,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 80 transitions. Stem has 4 letters. Loop has 30 letters. [2024-11-19 14:14:57,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:14:57,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 80 transitions. Stem has 34 letters. Loop has 30 letters. [2024-11-19 14:14:57,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:14:57,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 80 transitions. Stem has 4 letters. Loop has 60 letters. [2024-11-19 14:14:57,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:14:57,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 264 transitions. [2024-11-19 14:14:57,811 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 41 [2024-11-19 14:14:57,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 175 states and 262 transitions. [2024-11-19 14:14:57,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2024-11-19 14:14:57,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2024-11-19 14:14:57,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 262 transitions. [2024-11-19 14:14:57,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:14:57,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 175 states and 262 transitions. [2024-11-19 14:14:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 262 transitions. [2024-11-19 14:14:57,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 154. [2024-11-19 14:14:57,856 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-19 14:14:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 229 transitions. [2024-11-19 14:14:57,861 INFO L240 hiAutomatonCegarLoop]: Abstraction has 154 states and 229 transitions. [2024-11-19 14:14:57,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:14:57,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:14:57,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:14:57,862 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-19 14:14:57,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:14:57,910 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2024-11-19 14:14:57,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 126 transitions. [2024-11-19 14:14:57,913 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-11-19 14:14:57,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 47 states and 65 transitions. [2024-11-19 14:14:57,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-11-19 14:14:57,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-11-19 14:14:57,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 65 transitions. [2024-11-19 14:14:57,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:14:57,915 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-19 14:14:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 65 transitions. [2024-11-19 14:14:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-11-19 14:14:57,921 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-19 14:14:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2024-11-19 14:14:57,922 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-19 14:14:57,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:14:57,926 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-19 14:14:57,926 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:14:57,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 63 transitions. [2024-11-19 14:14:57,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2024-11-19 14:14:57,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:14:57,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:14:57,927 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:14:57,927 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-19 14:14:57,928 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-19 14:14:57,928 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-19 14:14:57,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:57,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 4 times [2024-11-19 14:14:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:57,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421492330] [2024-11-19 14:14:57,930 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:14:57,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:57,934 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:14:57,934 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:14:57,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:14:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:57,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:14:57,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:57,937 INFO L85 PathProgramCache]: Analyzing trace with hash -481826528, now seen corresponding path program 1 times [2024-11-19 14:14:57,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:57,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812368186] [2024-11-19 14:14:57,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:57,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 14:14:57,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375244611] [2024-11-19 14:14:57,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:57,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:14:57,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:57,967 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-19 14:14:57,969 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-19 14:14:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:58,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:14:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:58,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:14:58,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:58,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1147386361, now seen corresponding path program 1 times [2024-11-19 14:14:58,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:58,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960529520] [2024-11-19 14:14:58,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:58,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 14:14:58,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358529729] [2024-11-19 14:14:58,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:58,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:14:58,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,068 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-19 14:14:58,072 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-19 14:14:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:58,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:14:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:58,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:14:58,346 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:14:58,347 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:14:58,347 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:14:58,347 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:14:58,347 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:14:58,347 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,347 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:14:58,347 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:14:58,347 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration4_Loop [2024-11-19 14:14:58,347 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:14:58,347 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:14:58,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,427 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:14:58,427 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:14:58,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,432 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-19 14:14:58,437 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-19 14:14:58,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:14:58,437 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:58,454 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:14:58,454 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-19 14:14:58,469 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-19 14:14:58,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,473 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-19 14:14:58,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:14:58,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:58,478 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-19 14:14:58,493 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:14:58,494 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-19 14:14:58,508 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-19 14:14:58,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,510 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-19 14:14:58,511 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-19 14:14:58,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:14:58,513 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:58,526 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:14:58,526 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-19 14:14:58,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-19 14:14:58,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,538 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-19 14:14:58,539 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-19 14:14:58,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:14:58,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:58,551 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:14:58,551 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-19 14:14:58,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-19 14:14:58,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,563 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-19 14:14:58,564 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-19 14:14:58,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:14:58,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:58,586 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-19 14:14:58,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,588 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-19 14:14:58,589 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-19 14:14:58,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:14:58,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:14:58,630 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:14:58,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-19 14:14:58,634 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:14:58,634 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:14:58,634 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:14:58,634 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:14:58,634 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:14:58,634 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,634 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:14:58,634 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:14:58,634 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration4_Loop [2024-11-19 14:14:58,635 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:14:58,635 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:14:58,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:14:58,720 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-19 14:14:58,741 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:14:58,741 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:14:58,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,746 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-19 14:14:58,747 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-19 14:14:58,748 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-19 14:14:58,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:58,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:58,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:58,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:58,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:58,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:58,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:58,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:14:58,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-19 14:14:58,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,772 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-19 14:14:58,773 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-19 14:14:58,773 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-19 14:14:58,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:58,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:58,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:58,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:58,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:58,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:58,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:58,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:14:58,795 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-19 14:14:58,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,796 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-19 14:14:58,797 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-19 14:14:58,798 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-19 14:14:58,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:58,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:58,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:58,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:58,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:58,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:58,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:58,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:14:58,823 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-19 14:14:58,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,824 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-19 14:14:58,825 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-19 14:14:58,826 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-19 14:14:58,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:58,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:58,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:58,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:58,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:58,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:58,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:58,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:14:58,853 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-19 14:14:58,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,854 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-19 14:14:58,855 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-19 14:14:58,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:14:58,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:58,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:58,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:58,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:58,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:58,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:58,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:58,868 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:14:58,878 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-19 14:14:58,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,880 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-19 14:14:58,881 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-19 14:14:58,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-19 14:14:58,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:58,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:58,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:58,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:58,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:58,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:58,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:58,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:14:58,910 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-19 14:14:58,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,912 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-19 14:14:58,913 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-19 14:14:58,915 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-19 14:14:58,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:14:58,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:14:58,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:14:58,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:14:58,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:14:58,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:14:58,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:14:58,928 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:14:58,934 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:14:58,934 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:14:58,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:14:58,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:58,936 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-19 14:14:58,937 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-19 14:14:58,939 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:14:58,939 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:14:58,939 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:14:58,939 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-19 14:14:58,954 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-19 14:14:58,956 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:14:58,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:14:58,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:14:58,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:14:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:14:59,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 14:14:59,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:14:59,174 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-19 14:14:59,174 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-19 14:14:59,175 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-19 14:14:59,434 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-19 14:14:59,435 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-19 14:14:59,435 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-19 14:14:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2024-11-19 14:14:59,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 4 letters. Loop has 24 letters. [2024-11-19 14:14:59,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:14:59,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 28 letters. Loop has 24 letters. [2024-11-19 14:14:59,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:14:59,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 4 letters. Loop has 48 letters. [2024-11-19 14:14:59,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:14:59,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 246 transitions. [2024-11-19 14:14:59,440 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2024-11-19 14:14:59,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 161 states and 244 transitions. [2024-11-19 14:14:59,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2024-11-19 14:14:59,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2024-11-19 14:14:59,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 244 transitions. [2024-11-19 14:14:59,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:14:59,444 INFO L218 hiAutomatonCegarLoop]: Abstraction has 161 states and 244 transitions. [2024-11-19 14:14:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 244 transitions. [2024-11-19 14:14:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2024-11-19 14:14:59,455 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-19 14:14:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 225 transitions. [2024-11-19 14:14:59,457 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 225 transitions. [2024-11-19 14:14:59,457 INFO L425 stractBuchiCegarLoop]: Abstraction has 152 states and 225 transitions. [2024-11-19 14:14:59,457 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:14:59,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 225 transitions. [2024-11-19 14:14:59,459 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2024-11-19 14:14:59,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:14:59,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:14:59,460 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:14:59,460 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-19 14:14:59,460 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-19 14:14:59,460 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-19 14:14:59,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:59,460 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2024-11-19 14:14:59,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:59,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831648977] [2024-11-19 14:14:59,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:59,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:59,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:14:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:59,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:14:59,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1997853698, now seen corresponding path program 1 times [2024-11-19 14:14:59,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:59,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442470124] [2024-11-19 14:14:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:14:59,573 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-19 14:14:59,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:14:59,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442470124] [2024-11-19 14:14:59,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442470124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:14:59,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:14:59,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 14:14:59,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249208326] [2024-11-19 14:14:59,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:14:59,574 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:14:59,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:14:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 14:14:59,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 14:14:59,575 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-19 14:14:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:14:59,653 INFO L93 Difference]: Finished difference Result 197 states and 294 transitions. [2024-11-19 14:14:59,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 294 transitions. [2024-11-19 14:14:59,656 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 55 [2024-11-19 14:14:59,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 188 states and 285 transitions. [2024-11-19 14:14:59,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-11-19 14:14:59,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-11-19 14:14:59,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 285 transitions. [2024-11-19 14:14:59,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:14:59,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 188 states and 285 transitions. [2024-11-19 14:14:59,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 285 transitions. [2024-11-19 14:14:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 158. [2024-11-19 14:14:59,685 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-19 14:14:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 231 transitions. [2024-11-19 14:14:59,687 INFO L240 hiAutomatonCegarLoop]: Abstraction has 158 states and 231 transitions. [2024-11-19 14:14:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:14:59,690 INFO L425 stractBuchiCegarLoop]: Abstraction has 158 states and 231 transitions. [2024-11-19 14:14:59,690 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:14:59,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 231 transitions. [2024-11-19 14:14:59,691 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2024-11-19 14:14:59,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:14:59,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:14:59,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:14:59,693 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-19 14:14:59,693 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-19 14:14:59,694 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-19 14:14:59,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2024-11-19 14:14:59,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:59,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213873312] [2024-11-19 14:14:59,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:14:59,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:59,697 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:14:59,698 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:14:59,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:14:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:14:59,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:14:59,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:14:59,701 INFO L85 PathProgramCache]: Analyzing trace with hash 616908711, now seen corresponding path program 1 times [2024-11-19 14:14:59,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:14:59,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358379710] [2024-11-19 14:14:59,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:59,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:14:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:14:59,939 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-19 14:14:59,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:14:59,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358379710] [2024-11-19 14:14:59,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358379710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:14:59,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885675364] [2024-11-19 14:14:59,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:14:59,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:14:59,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:14:59,942 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-19 14:14:59,944 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-19 14:15:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:00,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:15:00,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:00,037 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-19 14:15:00,126 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-19 14:15:00,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:00,420 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-19 14:15:00,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885675364] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:00,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:00,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 16 [2024-11-19 14:15:00,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270873678] [2024-11-19 14:15:00,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:00,422 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:15:00,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:00,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 14:15:00,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-19 14:15:00,423 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-19 14:15:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:00,916 INFO L93 Difference]: Finished difference Result 325 states and 514 transitions. [2024-11-19 14:15:00,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 514 transitions. [2024-11-19 14:15:00,922 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2024-11-19 14:15:00,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 321 states and 502 transitions. [2024-11-19 14:15:00,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2024-11-19 14:15:00,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2024-11-19 14:15:00,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 321 states and 502 transitions. [2024-11-19 14:15:00,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:00,931 INFO L218 hiAutomatonCegarLoop]: Abstraction has 321 states and 502 transitions. [2024-11-19 14:15:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 502 transitions. [2024-11-19 14:15:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 272. [2024-11-19 14:15:00,963 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-19 14:15:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 419 transitions. [2024-11-19 14:15:00,966 INFO L240 hiAutomatonCegarLoop]: Abstraction has 272 states and 419 transitions. [2024-11-19 14:15:00,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 14:15:00,968 INFO L425 stractBuchiCegarLoop]: Abstraction has 272 states and 419 transitions. [2024-11-19 14:15:00,969 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:15:00,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 272 states and 419 transitions. [2024-11-19 14:15:00,971 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 57 [2024-11-19 14:15:00,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:00,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:00,973 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:15:00,975 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-19 14:15:00,975 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-19 14:15:00,975 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-19 14:15:00,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2024-11-19 14:15:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:00,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455139497] [2024-11-19 14:15:00,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:00,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:00,981 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:15:00,981 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:00,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:00,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:00,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:00,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1004069657, now seen corresponding path program 2 times [2024-11-19 14:15:00,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:00,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838938937] [2024-11-19 14:15:00,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:00,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:01,005 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:01,005 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:01,203 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-19 14:15:01,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:01,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838938937] [2024-11-19 14:15:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838938937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:01,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520963221] [2024-11-19 14:15:01,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:01,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:01,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:01,206 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-19 14:15:01,207 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-19 14:15:01,268 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:01,269 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:01,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:15:01,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:01,343 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-19 14:15:01,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:01,528 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-19 14:15:01,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520963221] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:01,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:01,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2024-11-19 14:15:01,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012567874] [2024-11-19 14:15:01,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:01,531 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:15:01,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 14:15:01,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-19 14:15:01,532 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-19 14:15:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:01,785 INFO L93 Difference]: Finished difference Result 332 states and 517 transitions. [2024-11-19 14:15:01,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 517 transitions. [2024-11-19 14:15:01,789 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 81 [2024-11-19 14:15:01,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 332 states and 517 transitions. [2024-11-19 14:15:01,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 [2024-11-19 14:15:01,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2024-11-19 14:15:01,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 332 states and 517 transitions. [2024-11-19 14:15:01,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:01,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 332 states and 517 transitions. [2024-11-19 14:15:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states and 517 transitions. [2024-11-19 14:15:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 292. [2024-11-19 14:15:01,817 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-19 14:15:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 455 transitions. [2024-11-19 14:15:01,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 292 states and 455 transitions. [2024-11-19 14:15:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 14:15:01,820 INFO L425 stractBuchiCegarLoop]: Abstraction has 292 states and 455 transitions. [2024-11-19 14:15:01,821 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:15:01,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 292 states and 455 transitions. [2024-11-19 14:15:01,823 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 61 [2024-11-19 14:15:01,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:01,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:01,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:15:01,825 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-19 14:15:01,825 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-19 14:15:01,825 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-19 14:15:01,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 4 times [2024-11-19 14:15:01,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:01,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907274844] [2024-11-19 14:15:01,828 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:01,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:01,832 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:01,832 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:01,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:01,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:01,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:01,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1995727769, now seen corresponding path program 3 times [2024-11-19 14:15:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:01,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619997640] [2024-11-19 14:15:01,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:01,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:01,873 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 14:15:01,874 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:02,007 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-19 14:15:02,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:02,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619997640] [2024-11-19 14:15:02,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619997640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:02,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287473560] [2024-11-19 14:15:02,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:02,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:02,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:02,010 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-19 14:15:02,012 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-19 14:15:02,074 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 14:15:02,074 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:02,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:15:02,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:02,141 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-19 14:15:02,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:02,358 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-19 14:15:02,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287473560] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:02,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:02,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2024-11-19 14:15:02,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816417485] [2024-11-19 14:15:02,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:02,359 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:15:02,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:02,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 14:15:02,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-19 14:15:02,360 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-19 14:15:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:02,550 INFO L93 Difference]: Finished difference Result 332 states and 539 transitions. [2024-11-19 14:15:02,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 539 transitions. [2024-11-19 14:15:02,555 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2024-11-19 14:15:02,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 332 states and 539 transitions. [2024-11-19 14:15:02,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2024-11-19 14:15:02,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2024-11-19 14:15:02,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 332 states and 539 transitions. [2024-11-19 14:15:02,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:02,561 INFO L218 hiAutomatonCegarLoop]: Abstraction has 332 states and 539 transitions. [2024-11-19 14:15:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states and 539 transitions. [2024-11-19 14:15:02,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 314. [2024-11-19 14:15:02,573 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-19 14:15:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 513 transitions. [2024-11-19 14:15:02,575 INFO L240 hiAutomatonCegarLoop]: Abstraction has 314 states and 513 transitions. [2024-11-19 14:15:02,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 14:15:02,576 INFO L425 stractBuchiCegarLoop]: Abstraction has 314 states and 513 transitions. [2024-11-19 14:15:02,576 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:15:02,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 513 transitions. [2024-11-19 14:15:02,579 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 73 [2024-11-19 14:15:02,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:02,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:02,580 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:15:02,580 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-19 14:15:02,580 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-19 14:15:02,581 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-19 14:15:02,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 5 times [2024-11-19 14:15:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:02,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268301571] [2024-11-19 14:15:02,582 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:02,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:02,585 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:15:02,585 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:02,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:02,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:02,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:02,589 INFO L85 PathProgramCache]: Analyzing trace with hash 881045351, now seen corresponding path program 4 times [2024-11-19 14:15:02,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:02,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327481797] [2024-11-19 14:15:02,589 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:02,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:02,611 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:02,612 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:02,845 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-19 14:15:02,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:02,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327481797] [2024-11-19 14:15:02,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327481797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:02,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142560560] [2024-11-19 14:15:02,846 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:02,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:02,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:02,848 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-19 14:15:02,849 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-19 14:15:02,911 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:02,912 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:02,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 14:15:02,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:02,997 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-19 14:15:02,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:03,350 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-19 14:15:03,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142560560] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:03,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:03,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 13] total 21 [2024-11-19 14:15:03,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840508938] [2024-11-19 14:15:03,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:03,351 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:15:03,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:03,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 14:15:03,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-19 14:15:03,352 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-19 14:15:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:03,868 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2024-11-19 14:15:03,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 474 states and 799 transitions. [2024-11-19 14:15:03,876 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 113 [2024-11-19 14:15:03,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 474 states to 474 states and 799 transitions. [2024-11-19 14:15:03,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2024-11-19 14:15:03,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2024-11-19 14:15:03,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 474 states and 799 transitions. [2024-11-19 14:15:03,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:03,885 INFO L218 hiAutomatonCegarLoop]: Abstraction has 474 states and 799 transitions. [2024-11-19 14:15:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states and 799 transitions. [2024-11-19 14:15:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 378. [2024-11-19 14:15:03,902 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-19 14:15:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 633 transitions. [2024-11-19 14:15:03,906 INFO L240 hiAutomatonCegarLoop]: Abstraction has 378 states and 633 transitions. [2024-11-19 14:15:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 14:15:03,907 INFO L425 stractBuchiCegarLoop]: Abstraction has 378 states and 633 transitions. [2024-11-19 14:15:03,908 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 14:15:03,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 378 states and 633 transitions. [2024-11-19 14:15:03,911 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 100 [2024-11-19 14:15:03,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:03,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:03,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:15:03,914 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-19 14:15:03,914 INFO L745 eck$LassoCheckResult]: Stem: 6280#$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; 6533#L25 assume !(~n <= 0); 6234#L26 call #t~ret0 := fact(~n - 1);< 6235#$Ultimate##0 ~n := #in~n; 6338#L25 assume ~n <= 0;#res := 1; 6337#factFINAL assume true; 6330#factEXIT >#70#return; 6336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6403#factFINAL assume true; 6383#factEXIT >#72#return; 6236#L30-1 [2024-11-19 14:15:03,914 INFO L747 eck$LassoCheckResult]: Loop: 6236#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 6223#$Ultimate##0 ~n := #in~n; 6533#L25 assume !(~n <= 0); 6234#L26 call #t~ret0 := fact(~n - 1);< 6235#$Ultimate##0 ~n := #in~n; 6338#L25 assume ~n <= 0;#res := 1; 6337#factFINAL assume true; 6330#factEXIT >#70#return; 6336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6403#factFINAL assume true; 6383#factEXIT >#74#return; 6371#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 6375#$Ultimate##0 ~n := #in~n; 6391#L25 assume ~n <= 0;#res := 1; 6374#factFINAL assume true; 6366#factEXIT >#76#return; 6354#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; 6259#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; 6260#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6279#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 6431#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; 6396#L25 assume !(~n <= 0); 6320#L26 call #t~ret0 := fact(~n - 1);< 6327#$Ultimate##0 ~n := #in~n; 6406#L25 assume !(~n <= 0); 6323#L26 call #t~ret0 := fact(~n - 1);< 6327#$Ultimate##0 ~n := #in~n; 6406#L25 assume ~n <= 0;#res := 1; 6337#factFINAL assume true; 6330#factEXIT >#70#return; 6326#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6405#factFINAL assume true; 6319#factEXIT >#70#return; 6324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6393#factFINAL assume true; 6376#factEXIT >#78#return; 6177#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 6277#$Ultimate##0 ~n := #in~n; 6535#L25 assume ~n <= 0;#res := 1; 6357#factFINAL assume true; 6353#factEXIT >#80#return; 6174#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 6220#$Ultimate##0 ~n := #in~n; 6397#L25 assume !(~n <= 0); 6320#L26 call #t~ret0 := fact(~n - 1);< 6327#$Ultimate##0 ~n := #in~n; 6406#L25 assume ~n <= 0;#res := 1; 6337#factFINAL assume true; 6330#factEXIT >#70#return; 6334#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6409#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; 6288#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; 6286#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6287#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 6281#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; 6381#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 6378#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; 6370#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 6372#$Ultimate##0 ~n := #in~n; 6401#L25 assume !(~n <= 0); 6268#L26 call #t~ret0 := fact(~n - 1);< 6327#$Ultimate##0 ~n := #in~n; 6406#L25 assume ~n <= 0;#res := 1; 6337#factFINAL assume true; 6330#factEXIT >#70#return; 6336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6403#factFINAL assume true; 6383#factEXIT >#72#return; 6236#L30-1 [2024-11-19 14:15:03,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1646072980, now seen corresponding path program 1 times [2024-11-19 14:15:03,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:03,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270740330] [2024-11-19 14:15:03,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:03,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:03,961 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-19 14:15:03,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:03,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270740330] [2024-11-19 14:15:03,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270740330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:03,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051442735] [2024-11-19 14:15:03,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:03,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:03,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:03,965 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-19 14:15:03,967 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-19 14:15:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:04,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:15:04,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:04,028 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-19 14:15:04,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:04,083 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-19 14:15:04,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051442735] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:04,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:04,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-19 14:15:04,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154003785] [2024-11-19 14:15:04,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:04,084 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:04,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:04,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1264246555, now seen corresponding path program 5 times [2024-11-19 14:15:04,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:04,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666510559] [2024-11-19 14:15:04,085 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:04,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:04,108 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-19 14:15:04,109 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 75 proven. 63 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-19 14:15:04,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:04,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666510559] [2024-11-19 14:15:04,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666510559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:04,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874917489] [2024-11-19 14:15:04,260 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:04,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:04,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:04,264 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-19 14:15:04,265 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-19 14:15:04,337 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-19 14:15:04,338 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:04,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 14:15:04,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 151 proven. 29 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-19 14:15:04,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 71 proven. 68 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-19 14:15:04,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874917489] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:04,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:04,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 16 [2024-11-19 14:15:04,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231414298] [2024-11-19 14:15:04,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:04,741 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:15:04,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:04,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 14:15:04,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 14:15:04,742 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-19 14:15:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:04,843 INFO L93 Difference]: Finished difference Result 440 states and 754 transitions. [2024-11-19 14:15:04,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 440 states and 754 transitions. [2024-11-19 14:15:04,848 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 127 [2024-11-19 14:15:04,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 440 states to 440 states and 754 transitions. [2024-11-19 14:15:04,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2024-11-19 14:15:04,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2024-11-19 14:15:04,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 440 states and 754 transitions. [2024-11-19 14:15:04,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:04,892 INFO L218 hiAutomatonCegarLoop]: Abstraction has 440 states and 754 transitions. [2024-11-19 14:15:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states and 754 transitions. [2024-11-19 14:15:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2024-11-19 14:15:04,907 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-19 14:15:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 752 transitions. [2024-11-19 14:15:04,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 438 states and 752 transitions. [2024-11-19 14:15:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 14:15:04,912 INFO L425 stractBuchiCegarLoop]: Abstraction has 438 states and 752 transitions. [2024-11-19 14:15:04,912 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 14:15:04,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 438 states and 752 transitions. [2024-11-19 14:15:04,915 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 127 [2024-11-19 14:15:04,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:04,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:04,916 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-19 14:15:04,916 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:15:04,916 INFO L745 eck$LassoCheckResult]: Stem: 7621#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 7571#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; 7572#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; 7595#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; 7583#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7584#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7599#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; 7600#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7733#$Ultimate##0 ~n := #in~n; 7867#L25 assume ~n <= 0;#res := 1; 7815#factFINAL assume true; 7793#factEXIT >#72#return; 7728#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7729#$Ultimate##0 ~n := #in~n; 7726#L25 assume ~n <= 0;#res := 1; 7610#factFINAL assume true; 7904#factEXIT >#74#return; 7552#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7908#$Ultimate##0 ~n := #in~n; 7907#L25 assume !(~n <= 0); 7577#L26 call #t~ret0 := fact(~n - 1);< 7578#$Ultimate##0 [2024-11-19 14:15:04,916 INFO L747 eck$LassoCheckResult]: Loop: 7578#$Ultimate##0 ~n := #in~n; 7700#L25 assume !(~n <= 0); 7687#L26 call #t~ret0 := fact(~n - 1);< 7578#$Ultimate##0 [2024-11-19 14:15:04,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:04,917 INFO L85 PathProgramCache]: Analyzing trace with hash 342068977, now seen corresponding path program 1 times [2024-11-19 14:15:04,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:04,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025069159] [2024-11-19 14:15:04,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:04,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:04,973 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-19 14:15:04,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:04,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025069159] [2024-11-19 14:15:04,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025069159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:15:04,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:15:04,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 14:15:04,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131317232] [2024-11-19 14:15:04,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:15:04,974 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:04,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2024-11-19 14:15:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:04,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843609511] [2024-11-19 14:15:04,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:04,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:04,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:04,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:05,009 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:05,009 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:05,009 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:05,009 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:05,009 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:05,009 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:05,009 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:05,010 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:05,010 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2024-11-19 14:15:05,010 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:05,010 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:05,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:05,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:05,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:05,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:05,044 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:05,044 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:05,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:05,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:05,047 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-19 14:15:05,049 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-19 14:15:05,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:05,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:05,065 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:05,065 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:15:05,080 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-19 14:15:05,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:05,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:05,083 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-19 14:15:05,084 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-19 14:15:05,085 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:05,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:05,096 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:05,097 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-19 14:15:05,107 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-19 14:15:05,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:05,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:05,109 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-19 14:15:05,109 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-19 14:15:05,110 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:05,110 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:05,122 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:05,122 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:15:05,132 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-19 14:15:05,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:05,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:05,134 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-19 14:15:05,136 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-19 14:15:05,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:05,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:05,158 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-19 14:15:05,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:05,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:05,159 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-19 14:15:05,160 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-19 14:15:05,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:05,161 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:05,187 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:05,191 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-19 14:15:05,192 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:05,192 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:05,192 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:05,192 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:05,192 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:05,192 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:05,192 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:05,192 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:05,192 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2024-11-19 14:15:05,192 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:05,193 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:05,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:05,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:05,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:05,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:05,227 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:05,227 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:05,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:05,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:05,229 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-19 14:15:05,231 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-19 14:15:05,231 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-19 14:15:05,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:05,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:05,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:05,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:05,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:05,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:05,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:05,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:05,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:05,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:05,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:05,255 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-19 14:15:05,256 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-19 14:15:05,257 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-19 14:15:05,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:05,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:05,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:05,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:05,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:05,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:05,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:05,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:05,279 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-19 14:15:05,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:05,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:05,280 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-19 14:15:05,281 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-19 14:15:05,281 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-19 14:15:05,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:05,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:05,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:05,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:05,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:05,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:05,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:05,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:05,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-19 14:15:05,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:05,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:05,305 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-19 14:15:05,306 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-19 14:15:05,307 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-19 14:15:05,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:05,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:05,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:05,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:05,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:05,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:05,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:05,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:05,322 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:05,322 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:15:05,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:05,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:05,324 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-19 14:15:05,325 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-19 14:15:05,325 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:05,326 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:05,326 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:05,326 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2024-11-19 14:15:05,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-19 14:15:05,337 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:05,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:05,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:15:05,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:05,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:15:05,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:05,496 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-19 14:15:05,496 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-19 14:15:05,497 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-19 14:15:05,606 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-19 14:15:05,607 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-19 14:15:05,608 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-19 14:15:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2024-11-19 14:15:05,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 21 letters. Loop has 3 letters. [2024-11-19 14:15:05,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:05,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 24 letters. Loop has 3 letters. [2024-11-19 14:15:05,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:05,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 21 letters. Loop has 6 letters. [2024-11-19 14:15:05,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:05,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 548 states and 914 transitions. [2024-11-19 14:15:05,618 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 135 [2024-11-19 14:15:05,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 548 states to 532 states and 892 transitions. [2024-11-19 14:15:05,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 259 [2024-11-19 14:15:05,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 262 [2024-11-19 14:15:05,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 532 states and 892 transitions. [2024-11-19 14:15:05,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:05,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 532 states and 892 transitions. [2024-11-19 14:15:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states and 892 transitions. [2024-11-19 14:15:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 526. [2024-11-19 14:15:05,645 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-19 14:15:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 882 transitions. [2024-11-19 14:15:05,650 INFO L240 hiAutomatonCegarLoop]: Abstraction has 526 states and 882 transitions. [2024-11-19 14:15:05,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 14:15:05,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 14:15:05,650 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-19 14:15:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:05,781 INFO L93 Difference]: Finished difference Result 628 states and 1000 transitions. [2024-11-19 14:15:05,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 628 states and 1000 transitions. [2024-11-19 14:15:05,788 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 157 [2024-11-19 14:15:05,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 628 states to 614 states and 984 transitions. [2024-11-19 14:15:05,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2024-11-19 14:15:05,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2024-11-19 14:15:05,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 614 states and 984 transitions. [2024-11-19 14:15:05,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:05,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 614 states and 984 transitions. [2024-11-19 14:15:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states and 984 transitions. [2024-11-19 14:15:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 588. [2024-11-19 14:15:05,810 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-19 14:15:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 952 transitions. [2024-11-19 14:15:05,815 INFO L240 hiAutomatonCegarLoop]: Abstraction has 588 states and 952 transitions. [2024-11-19 14:15:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 14:15:05,816 INFO L425 stractBuchiCegarLoop]: Abstraction has 588 states and 952 transitions. [2024-11-19 14:15:05,816 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-19 14:15:05,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 588 states and 952 transitions. [2024-11-19 14:15:05,820 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2024-11-19 14:15:05,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:05,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:05,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:15:05,822 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:15:05,822 INFO L745 eck$LassoCheckResult]: Stem: 9924#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 9839#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; 9840#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; 9863#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; 9851#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 9852#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9907#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; 10070#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10080#$Ultimate##0 ~n := #in~n; 10084#L25 assume ~n <= 0;#res := 1; 10082#factFINAL assume true; 10079#factEXIT >#72#return; 9846#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 10077#$Ultimate##0 ~n := #in~n; 10081#L25 assume ~n <= 0;#res := 1; 10078#factFINAL assume true; 10076#factEXIT >#74#return; 9904#L30-2 [2024-11-19 14:15:05,822 INFO L747 eck$LassoCheckResult]: Loop: 9904#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10075#$Ultimate##0 ~n := #in~n; 9903#L25 assume ~n <= 0;#res := 1; 9905#factFINAL assume true; 10074#factEXIT >#76#return; 10073#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; 10072#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; 10071#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10067#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10065#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; 9966#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9919#$Ultimate##0 ~n := #in~n; 10063#L25 assume ~n <= 0;#res := 1; 10064#factFINAL assume true; 10062#factEXIT >#72#return; 9960#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9919#$Ultimate##0 ~n := #in~n; 10063#L25 assume ~n <= 0;#res := 1; 10064#factFINAL assume true; 10062#factEXIT >#74#return; 9904#L30-2 [2024-11-19 14:15:05,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:05,822 INFO L85 PathProgramCache]: Analyzing trace with hash -971449381, now seen corresponding path program 1 times [2024-11-19 14:15:05,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:05,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751563999] [2024-11-19 14:15:05,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:05,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:05,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:05,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:05,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:05,832 INFO L85 PathProgramCache]: Analyzing trace with hash 430618666, now seen corresponding path program 1 times [2024-11-19 14:15:05,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:05,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882320234] [2024-11-19 14:15:05,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:05,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 14:15:05,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [224021673] [2024-11-19 14:15:05,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:05,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:05,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:05,842 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-19 14:15:05,843 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-19 14:15:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:05,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:05,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:05,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:05,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2013864708, now seen corresponding path program 1 times [2024-11-19 14:15:05,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:05,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539572016] [2024-11-19 14:15:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:05,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:05,948 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-19 14:15:05,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:05,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539572016] [2024-11-19 14:15:05,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539572016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:15:05,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:15:05,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 14:15:05,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386120570] [2024-11-19 14:15:05,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:15:06,161 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-19 14:15:06,195 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:06,195 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:06,195 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:06,195 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:06,195 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:06,195 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:06,196 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:06,196 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:06,196 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2024-11-19 14:15:06,196 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:06,196 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:06,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,287 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:06,287 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:06,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:06,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:06,289 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-19 14:15:06,290 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-19 14:15:06,291 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:06,291 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:06,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:06,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:06,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:06,324 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-19 14:15:06,324 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-19 14:15:06,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:06,326 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:06,673 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:06,679 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-19 14:15:06,679 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:06,679 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:06,679 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:06,679 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:06,679 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:06,679 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:06,679 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:06,679 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:06,679 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2024-11-19 14:15:06,679 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:06,679 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:06,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:06,757 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:06,757 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:06,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:06,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:06,758 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-19 14:15:06,760 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-19 14:15:06,760 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-19 14:15:06,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:06,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:06,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:06,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:06,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:06,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:06,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:06,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:06,783 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-19 14:15:06,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:06,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:06,784 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-19 14:15:06,785 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-19 14:15:06,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:06,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:06,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:06,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:06,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:06,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:06,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:06,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:06,800 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:06,804 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-19 14:15:06,804 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-19 14:15:06,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:06,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:06,806 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-19 14:15:06,807 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-19 14:15:06,807 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:06,807 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:06,807 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:06,807 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-19 14:15:06,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-19 14:15:06,818 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:06,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:06,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:15:06,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:06,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 14:15:06,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:07,053 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-19 14:15:07,054 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-19 14:15:07,054 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-19 14:15:07,249 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-19 14:15:07,250 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-19 14:15:07,251 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-19 14:15:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2024-11-19 14:15:07,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 59 transitions. Stem has 17 letters. Loop has 20 letters. [2024-11-19 14:15:07,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:07,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 59 transitions. Stem has 37 letters. Loop has 20 letters. [2024-11-19 14:15:07,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:07,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 59 transitions. Stem has 17 letters. Loop has 40 letters. [2024-11-19 14:15:07,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:07,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 972 states and 1448 transitions. [2024-11-19 14:15:07,270 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 137 [2024-11-19 14:15:07,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 972 states to 956 states and 1414 transitions. [2024-11-19 14:15:07,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 348 [2024-11-19 14:15:07,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2024-11-19 14:15:07,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 956 states and 1414 transitions. [2024-11-19 14:15:07,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:07,283 INFO L218 hiAutomatonCegarLoop]: Abstraction has 956 states and 1414 transitions. [2024-11-19 14:15:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states and 1414 transitions. [2024-11-19 14:15:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 944. [2024-11-19 14:15:07,307 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-19 14:15:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1402 transitions. [2024-11-19 14:15:07,313 INFO L240 hiAutomatonCegarLoop]: Abstraction has 944 states and 1402 transitions. [2024-11-19 14:15:07,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:07,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 14:15:07,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 14:15:07,314 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-19 14:15:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:07,397 INFO L93 Difference]: Finished difference Result 828 states and 1216 transitions. [2024-11-19 14:15:07,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 828 states and 1216 transitions. [2024-11-19 14:15:07,405 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 108 [2024-11-19 14:15:07,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 828 states to 804 states and 1180 transitions. [2024-11-19 14:15:07,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 300 [2024-11-19 14:15:07,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2024-11-19 14:15:07,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 804 states and 1180 transitions. [2024-11-19 14:15:07,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:07,415 INFO L218 hiAutomatonCegarLoop]: Abstraction has 804 states and 1180 transitions. [2024-11-19 14:15:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states and 1180 transitions. [2024-11-19 14:15:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 802. [2024-11-19 14:15:07,441 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-19 14:15:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1178 transitions. [2024-11-19 14:15:07,446 INFO L240 hiAutomatonCegarLoop]: Abstraction has 802 states and 1178 transitions. [2024-11-19 14:15:07,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:15:07,447 INFO L425 stractBuchiCegarLoop]: Abstraction has 802 states and 1178 transitions. [2024-11-19 14:15:07,448 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-19 14:15:07,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 802 states and 1178 transitions. [2024-11-19 14:15:07,453 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 108 [2024-11-19 14:15:07,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:07,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:07,454 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-19 14:15:07,456 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:15:07,456 INFO L745 eck$LassoCheckResult]: Stem: 13412#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 13350#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; 13351#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; 13376#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; 13363#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 13364#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 13575#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; 13341#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 13342#$Ultimate##0 ~n := #in~n; 13647#L25 assume ~n <= 0;#res := 1; 13645#factFINAL assume true; 13644#factEXIT >#72#return; 13395#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 13396#$Ultimate##0 ~n := #in~n; 13668#L25 assume !(~n <= 0); 13670#L26 call #t~ret0 := fact(~n - 1);< 13673#$Ultimate##0 ~n := #in~n; 13675#L25 assume ~n <= 0;#res := 1; 13674#factFINAL assume true; 13672#factEXIT >#70#return; 13671#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 13666#factFINAL assume true; 13652#factEXIT >#74#return; 13335#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 13337#$Ultimate##0 ~n := #in~n; 13681#L25 assume ~n <= 0;#res := 1; 13678#factFINAL assume true; 13676#factEXIT >#76#return; 13677#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; 13875#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; 13873#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13871#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 13870#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; 13426#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 13324#$Ultimate##0 ~n := #in~n; 13905#L25 assume !(~n <= 0); 13849#L26 call #t~ret0 := fact(~n - 1);< 13855#$Ultimate##0 [2024-11-19 14:15:07,456 INFO L747 eck$LassoCheckResult]: Loop: 13855#$Ultimate##0 ~n := #in~n; 13869#L25 assume !(~n <= 0); 13852#L26 call #t~ret0 := fact(~n - 1);< 13855#$Ultimate##0 [2024-11-19 14:15:07,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:07,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1727773308, now seen corresponding path program 1 times [2024-11-19 14:15:07,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:07,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820411808] [2024-11-19 14:15:07,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:07,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:07,532 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-19 14:15:07,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:07,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820411808] [2024-11-19 14:15:07,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820411808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:07,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805111321] [2024-11-19 14:15:07,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:07,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:07,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:07,536 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:07,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2024-11-19 14:15:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:07,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:15:07,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:07,641 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-19 14:15:07,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:07,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-11-19 14:15:07,708 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-19 14:15:07,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805111321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:07,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:07,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2024-11-19 14:15:07,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964160893] [2024-11-19 14:15:07,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:07,709 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:07,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 2 times [2024-11-19 14:15:07,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:07,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309215659] [2024-11-19 14:15:07,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:07,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:07,712 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:15:07,712 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:07,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:07,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:07,738 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:07,738 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:07,738 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:07,738 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:07,738 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:07,738 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:07,739 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:07,739 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:07,739 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2024-11-19 14:15:07,739 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:07,739 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:07,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:07,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:07,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:07,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:07,763 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:07,764 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:07,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:07,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:07,765 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-19 14:15:07,766 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-19 14:15:07,767 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:07,767 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:07,778 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:07,778 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:15:07,788 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-19 14:15:07,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:07,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:07,790 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-19 14:15:07,790 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-19 14:15:07,791 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:07,791 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:07,802 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:07,802 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:15:07,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-11-19 14:15:07,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:07,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:07,814 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:07,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-19 14:15:07,816 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:07,816 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:07,827 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:07,827 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-19 14:15:07,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-19 14:15:07,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:07,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:07,839 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-19 14:15:07,840 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-19 14:15:07,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:07,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:07,861 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-19 14:15:07,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:07,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:07,863 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-19 14:15:07,864 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-19 14:15:07,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:07,865 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:07,891 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:07,895 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-19 14:15:07,895 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:07,895 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:07,895 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:07,895 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:07,896 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:07,896 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:07,896 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:07,896 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:07,896 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2024-11-19 14:15:07,896 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:07,896 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:07,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:07,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:07,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:07,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:07,922 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:07,922 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:07,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:07,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:07,924 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-19 14:15:07,924 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-19 14:15:07,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-19 14:15:07,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:07,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:07,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:07,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:07,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:07,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:07,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:07,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:07,948 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-19 14:15:07,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:07,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:07,950 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-19 14:15:07,951 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-19 14:15:07,951 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-19 14:15:07,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:07,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:07,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:07,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:07,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:07,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:07,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:07,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:07,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-11-19 14:15:07,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:07,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:07,976 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-19 14:15:07,977 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-19 14:15:07,978 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-19 14:15:07,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:07,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:07,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:07,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:07,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:07,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:07,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:07,990 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:08,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-11-19 14:15:08,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:08,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:08,002 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:08,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-11-19 14:15:08,004 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-19 14:15:08,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:08,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:08,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:08,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:08,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:08,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:08,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:08,016 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:08,018 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:08,018 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:15:08,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:08,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:08,020 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:08,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-11-19 14:15:08,021 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:08,021 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:08,021 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:08,021 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2024-11-19 14:15:08,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:08,032 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:08,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:08,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 14:15:08,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:08,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:15:08,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:08,290 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-19 14:15:08,291 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-19 14:15:08,291 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-19 14:15:08,384 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-19 14:15:08,386 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-19 14:15:08,387 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-19 14:15:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2024-11-19 14:15:08,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 37 letters. Loop has 3 letters. [2024-11-19 14:15:08,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:08,388 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:08,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:08,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 14:15:08,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:08,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:15:08,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:08,628 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-19 14:15:08,629 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-19 14:15:08,629 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-19 14:15:08,715 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-19 14:15:08,716 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-19 14:15:08,716 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-19 14:15:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2024-11-19 14:15:08,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 37 letters. Loop has 3 letters. [2024-11-19 14:15:08,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:08,717 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:08,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:08,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 14:15:08,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:08,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:15:08,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:08,961 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-19 14:15:08,962 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-19 14:15:08,962 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-19 14:15:09,060 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-19 14:15:09,061 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-19 14:15:09,061 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-19 14:15:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2024-11-19 14:15:09,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 37 letters. Loop has 3 letters. [2024-11-19 14:15:09,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:09,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 40 letters. Loop has 3 letters. [2024-11-19 14:15:09,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:09,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 37 letters. Loop has 6 letters. [2024-11-19 14:15:09,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:09,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 970 states and 1372 transitions. [2024-11-19 14:15:09,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:09,098 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 102 [2024-11-19 14:15:09,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 970 states to 852 states and 1248 transitions. [2024-11-19 14:15:09,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2024-11-19 14:15:09,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2024-11-19 14:15:09,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 852 states and 1248 transitions. [2024-11-19 14:15:09,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:09,109 INFO L218 hiAutomatonCegarLoop]: Abstraction has 852 states and 1248 transitions. [2024-11-19 14:15:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states and 1248 transitions. [2024-11-19 14:15:09,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 802. [2024-11-19 14:15:09,137 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-19 14:15:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1170 transitions. [2024-11-19 14:15:09,141 INFO L240 hiAutomatonCegarLoop]: Abstraction has 802 states and 1170 transitions. [2024-11-19 14:15:09,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:09,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 14:15:09,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-19 14:15:09,142 INFO L87 Difference]: Start difference. First operand 802 states and 1170 transitions. Second operand has 10 states, 8 states have (on average 3.625) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-19 14:15:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:09,271 INFO L93 Difference]: Finished difference Result 762 states and 1082 transitions. [2024-11-19 14:15:09,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 762 states and 1082 transitions. [2024-11-19 14:15:09,279 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 105 [2024-11-19 14:15:09,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 762 states to 742 states and 1054 transitions. [2024-11-19 14:15:09,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 281 [2024-11-19 14:15:09,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 281 [2024-11-19 14:15:09,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 742 states and 1054 transitions. [2024-11-19 14:15:09,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:09,288 INFO L218 hiAutomatonCegarLoop]: Abstraction has 742 states and 1054 transitions. [2024-11-19 14:15:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states and 1054 transitions. [2024-11-19 14:15:09,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 712. [2024-11-19 14:15:09,309 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-19 14:15:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1024 transitions. [2024-11-19 14:15:09,312 INFO L240 hiAutomatonCegarLoop]: Abstraction has 712 states and 1024 transitions. [2024-11-19 14:15:09,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 14:15:09,313 INFO L425 stractBuchiCegarLoop]: Abstraction has 712 states and 1024 transitions. [2024-11-19 14:15:09,314 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-19 14:15:09,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 712 states and 1024 transitions. [2024-11-19 14:15:09,319 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 99 [2024-11-19 14:15:09,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:09,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:09,321 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 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] [2024-11-19 14:15:09,321 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:15:09,321 INFO L745 eck$LassoCheckResult]: Stem: 19127#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 19067#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; 19068#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; 19096#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; 19128#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 19248#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 19249#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; 19063#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 19064#$Ultimate##0 ~n := #in~n; 19274#L25 assume ~n <= 0;#res := 1; 19272#factFINAL assume true; 19271#factEXIT >#72#return; 19116#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 19117#$Ultimate##0 ~n := #in~n; 19406#L25 assume ~n <= 0;#res := 1; 19405#factFINAL assume true; 19399#factEXIT >#74#return; 19055#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 19057#$Ultimate##0 ~n := #in~n; 19608#L25 assume ~n <= 0;#res := 1; 19600#factFINAL assume true; 19599#factEXIT >#76#return; 19094#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; 19095#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; 19110#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19630#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 19101#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; 19047#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 19048#$Ultimate##0 ~n := #in~n; 19677#L25 assume ~n <= 0;#res := 1; 19678#factFINAL assume true; 19680#factEXIT >#78#return; 19050#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 19126#$Ultimate##0 ~n := #in~n; 19111#L25 assume ~n <= 0;#res := 1; 19061#factFINAL assume true; 19049#factEXIT >#80#return; 19051#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 19146#$Ultimate##0 ~n := #in~n; 19744#L25 assume !(~n <= 0); 19083#L26 call #t~ret0 := fact(~n - 1);< 19719#$Ultimate##0 ~n := #in~n; 19720#L25 assume ~n <= 0;#res := 1; 19739#factFINAL assume true; 19733#factEXIT >#70#return; 19734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19756#factFINAL assume true; 19755#factEXIT >#82#return; 19144#L30-8 [2024-11-19 14:15:09,321 INFO L747 eck$LassoCheckResult]: Loop: 19144#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; 19097#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; 19098#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19738#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 19737#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; 19121#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 19120#$Ultimate##0 ~n := #in~n; 19122#L25 assume !(~n <= 0); 19080#L26 call #t~ret0 := fact(~n - 1);< 19721#$Ultimate##0 ~n := #in~n; 19742#L25 assume ~n <= 0;#res := 1; 19740#factFINAL assume true; 19735#factEXIT >#70#return; 19732#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19730#factFINAL assume true; 19728#factEXIT >#78#return; 19074#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 19124#$Ultimate##0 ~n := #in~n; 19726#L25 assume ~n <= 0;#res := 1; 19727#factFINAL assume true; 19729#factEXIT >#80#return; 19724#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 19725#$Ultimate##0 ~n := #in~n; 19736#L25 assume !(~n <= 0); 19080#L26 call #t~ret0 := fact(~n - 1);< 19721#$Ultimate##0 ~n := #in~n; 19742#L25 assume ~n <= 0;#res := 1; 19740#factFINAL assume true; 19735#factEXIT >#70#return; 19732#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19730#factFINAL assume true; 19728#factEXIT >#82#return; 19144#L30-8 [2024-11-19 14:15:09,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:09,322 INFO L85 PathProgramCache]: Analyzing trace with hash 248376115, now seen corresponding path program 1 times [2024-11-19 14:15:09,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:09,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210842595] [2024-11-19 14:15:09,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:09,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-19 14:15:09,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:09,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210842595] [2024-11-19 14:15:09,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210842595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:09,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255161082] [2024-11-19 14:15:09,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:09,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:09,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:09,408 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-19 14:15:09,410 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-19 14:15:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:09,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:15:09,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-19 14:15:09,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 14:15:09,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255161082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:15:09,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 14:15:09,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-19 14:15:09,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644966928] [2024-11-19 14:15:09,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:15:09,499 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:09,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash 35509244, now seen corresponding path program 1 times [2024-11-19 14:15:09,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:09,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958897484] [2024-11-19 14:15:09,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:09,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 14:15:09,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512743316] [2024-11-19 14:15:09,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:09,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:09,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:09,510 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-19 14:15:09,511 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-19 14:15:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:09,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:09,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:09,842 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:09,842 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:09,842 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:09,842 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:09,842 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:09,842 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:09,842 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:09,842 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:09,843 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2024-11-19 14:15:09,843 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:09,843 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:09,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:09,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:09,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:09,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:09,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:09,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:09,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:09,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:09,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:09,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:09,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:09,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:09,937 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:09,937 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:09,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:09,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:09,944 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:09,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-11-19 14:15:09,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:09,948 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:09,960 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:09,960 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-19 14:15:09,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:09,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:09,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:09,972 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-19 14:15:09,972 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-19 14:15:09,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:09,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:09,984 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:09,985 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:15:09,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:09,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:09,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:09,997 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-19 14:15:09,998 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-19 14:15:09,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:09,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:10,010 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:10,010 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-19 14:15:10,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-11-19 14:15:10,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:10,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:10,022 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-19 14:15:10,023 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-19 14:15:10,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:10,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:10,041 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:10,041 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=1} Honda state: {ULTIMATE.start_main_~x~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:15:10,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2024-11-19 14:15:10,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:10,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:10,053 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-19 14:15:10,053 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-19 14:15:10,054 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:10,054 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:10,065 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:10,065 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-19 14:15:10,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-11-19 14:15:10,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:10,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:10,076 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-19 14:15:10,077 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-19 14:15:10,077 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:10,077 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:10,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-11-19 14:15:10,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:10,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:10,100 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-19 14:15:10,101 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-19 14:15:10,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:10,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:10,113 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:10,123 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-19 14:15:10,123 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:10,124 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:10,124 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:10,124 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:10,124 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:10,124 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:10,124 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:10,124 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:10,124 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2024-11-19 14:15:10,124 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:10,124 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:10,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:10,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:10,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:10,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:10,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:10,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:10,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:10,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:10,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:10,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:10,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:10,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:10,219 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:10,219 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:10,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:10,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:10,221 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-19 14:15:10,221 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-19 14:15:10,222 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-19 14:15:10,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:10,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:10,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:10,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:10,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:10,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:10,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:10,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:10,244 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-19 14:15:10,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:10,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:10,245 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-19 14:15:10,246 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-19 14:15:10,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:10,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:10,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:10,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:10,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:10,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:10,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:10,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:10,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:10,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-11-19 14:15:10,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:10,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:10,270 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-19 14:15:10,271 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-19 14:15:10,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-19 14:15:10,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:10,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:10,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:10,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:10,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:10,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:10,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:10,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:10,293 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-19 14:15:10,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:10,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:10,295 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-19 14:15:10,295 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-19 14:15:10,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-19 14:15:10,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:10,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:10,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:10,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:10,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:10,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:10,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:10,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:10,318 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-19 14:15:10,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:10,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:10,320 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:10,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-11-19 14:15:10,321 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-19 14:15:10,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:10,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:10,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:10,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:10,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:10,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:10,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:10,334 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:10,336 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:10,336 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:10,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:10,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:10,337 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:10,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-11-19 14:15:10,338 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:10,338 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:10,338 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:10,339 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-19 14:15:10,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2024-11-19 14:15:10,350 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:10,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:10,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:15:10,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:10,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:10,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 14:15:10,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 14:15:10,858 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-19 14:15:10,859 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 712 states and 1024 transitions. cyclomatic complexity: 326 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-19 14:15:11,071 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 712 states and 1024 transitions. cyclomatic complexity: 326. 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 1241 states and 1653 transitions. Complement of second has 49 states. [2024-11-19 14:15:11,072 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-19 14:15:11,072 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-19 14:15:11,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2024-11-19 14:15:11,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 66 transitions. Stem has 48 letters. Loop has 32 letters. [2024-11-19 14:15:11,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:11,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 66 transitions. Stem has 80 letters. Loop has 32 letters. [2024-11-19 14:15:11,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:11,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 66 transitions. Stem has 48 letters. Loop has 64 letters. [2024-11-19 14:15:11,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:11,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1241 states and 1653 transitions. [2024-11-19 14:15:11,085 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2024-11-19 14:15:11,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1241 states to 1065 states and 1429 transitions. [2024-11-19 14:15:11,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 314 [2024-11-19 14:15:11,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 316 [2024-11-19 14:15:11,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1065 states and 1429 transitions. [2024-11-19 14:15:11,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:11,096 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1065 states and 1429 transitions. [2024-11-19 14:15:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states and 1429 transitions. [2024-11-19 14:15:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 948. [2024-11-19 14:15:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 608 states have (on average 1.1217105263157894) internal successors, (682), 609 states have internal predecessors, (682), 212 states have call successors, (222), 130 states have call predecessors, (222), 128 states have return successors, (378), 208 states have call predecessors, (378), 212 states have call successors, (378) [2024-11-19 14:15:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1282 transitions. [2024-11-19 14:15:11,121 INFO L240 hiAutomatonCegarLoop]: Abstraction has 948 states and 1282 transitions. [2024-11-19 14:15:11,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:11,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 14:15:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 14:15:11,122 INFO L87 Difference]: Start difference. First operand 948 states and 1282 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-19 14:15:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:11,234 INFO L93 Difference]: Finished difference Result 892 states and 1180 transitions. [2024-11-19 14:15:11,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 892 states and 1180 transitions. [2024-11-19 14:15:11,240 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 102 [2024-11-19 14:15:11,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 892 states to 692 states and 938 transitions. [2024-11-19 14:15:11,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2024-11-19 14:15:11,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 288 [2024-11-19 14:15:11,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 692 states and 938 transitions. [2024-11-19 14:15:11,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:11,246 INFO L218 hiAutomatonCegarLoop]: Abstraction has 692 states and 938 transitions. [2024-11-19 14:15:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states and 938 transitions. [2024-11-19 14:15:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 668. [2024-11-19 14:15:11,258 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-19 14:15:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 914 transitions. [2024-11-19 14:15:11,261 INFO L240 hiAutomatonCegarLoop]: Abstraction has 668 states and 914 transitions. [2024-11-19 14:15:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 14:15:11,262 INFO L425 stractBuchiCegarLoop]: Abstraction has 668 states and 914 transitions. [2024-11-19 14:15:11,262 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-19 14:15:11,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 668 states and 914 transitions. [2024-11-19 14:15:11,265 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 96 [2024-11-19 14:15:11,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:11,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:11,266 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-19 14:15:11,266 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-19 14:15:11,267 INFO L745 eck$LassoCheckResult]: Stem: 23382#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 23325#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; 23326#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; 23348#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; 23383#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 23506#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 23502#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; 23321#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 23322#$Ultimate##0 ~n := #in~n; 23571#L25 assume ~n <= 0;#res := 1; 23570#factFINAL assume true; 23569#factEXIT >#72#return; 23311#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 23376#$Ultimate##0 ~n := #in~n; 23368#L25 assume ~n <= 0;#res := 1; 23319#factFINAL assume true; 23310#factEXIT >#74#return; 23312#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 23316#$Ultimate##0 ~n := #in~n; 23566#L25 assume ~n <= 0;#res := 1; 23564#factFINAL assume true; 23563#factEXIT >#76#return; 23561#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; 23560#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; 23557#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 23558#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 23552#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; 23358#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 23627#$Ultimate##0 ~n := #in~n; 23637#L25 assume !(~n <= 0); 23631#L26 call #t~ret0 := fact(~n - 1);< 23634#$Ultimate##0 ~n := #in~n; 23703#L25 assume ~n <= 0;#res := 1; 23702#factFINAL assume true; 23689#factEXIT >#70#return; 23357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23361#factFINAL assume true; 23624#factEXIT >#78#return; 23359#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 23378#$Ultimate##0 ~n := #in~n; 23720#L25 assume ~n <= 0;#res := 1; 23721#factFINAL assume true; 23812#factEXIT >#80#return; 23332#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 23384#$Ultimate##0 ~n := #in~n; 23715#L25 assume !(~n <= 0); 23331#L26 call #t~ret0 := fact(~n - 1);< 23333#$Ultimate##0 ~n := #in~n; 23640#L25 assume ~n <= 0;#res := 1; 23692#factFINAL assume true; 23690#factEXIT >#70#return; 23357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23361#factFINAL assume true; 23624#factEXIT >#82#return; 23625#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; 23349#binomialCoefficient_returnLabel#2 [2024-11-19 14:15:11,267 INFO L747 eck$LassoCheckResult]: Loop: 23349#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; 23350#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 23554#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 23555#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; 23306#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 23307#$Ultimate##0 ~n := #in~n; 23681#L25 assume !(~n <= 0); 23659#L26 call #t~ret0 := fact(~n - 1);< 23663#$Ultimate##0 ~n := #in~n; 23678#L25 assume !(~n <= 0); 23658#L26 call #t~ret0 := fact(~n - 1);< 23667#$Ultimate##0 ~n := #in~n; 23676#L25 assume ~n <= 0;#res := 1; 23673#factFINAL assume true; 23672#factEXIT >#70#return; 23662#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23666#factFINAL assume true; 23657#factEXIT >#70#return; 23655#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23653#factFINAL assume true; 23652#factEXIT >#78#return; 23648#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 23650#$Ultimate##0 ~n := #in~n; 23677#L25 assume !(~n <= 0); 23670#L26 call #t~ret0 := fact(~n - 1);< 23675#$Ultimate##0 ~n := #in~n; 23679#L25 assume ~n <= 0;#res := 1; 23674#factFINAL assume true; 23669#factEXIT >#70#return; 23671#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23646#factFINAL assume true; 23649#factEXIT >#80#return; 23647#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 23654#$Ultimate##0 ~n := #in~n; 23680#L25 assume !(~n <= 0); 23659#L26 call #t~ret0 := fact(~n - 1);< 23663#$Ultimate##0 ~n := #in~n; 23679#L25 assume ~n <= 0;#res := 1; 23674#factFINAL assume true; 23669#factEXIT >#70#return; 23671#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23646#factFINAL assume true; 23649#factEXIT >#82#return; 23395#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; 23349#binomialCoefficient_returnLabel#2 [2024-11-19 14:15:11,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:11,267 INFO L85 PathProgramCache]: Analyzing trace with hash -453366944, now seen corresponding path program 1 times [2024-11-19 14:15:11,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:11,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367570053] [2024-11-19 14:15:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:11,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 14:15:11,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1701201617] [2024-11-19 14:15:11,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:11,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:11,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:11,281 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-19 14:15:11,282 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-19 14:15:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:11,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:11,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:11,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:11,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1634885402, now seen corresponding path program 2 times [2024-11-19 14:15:11,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:11,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386246064] [2024-11-19 14:15:11,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:11,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:11,388 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:11,388 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:15:11,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1607753480] [2024-11-19 14:15:11,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:11,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:11,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:11,391 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:11,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2024-11-19 14:15:11,456 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:11,456 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:11,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:11,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:11,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:11,480 INFO L85 PathProgramCache]: Analyzing trace with hash -690259515, now seen corresponding path program 1 times [2024-11-19 14:15:11,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:11,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734021388] [2024-11-19 14:15:11,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:11,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 45 proven. 11 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2024-11-19 14:15:11,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:11,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734021388] [2024-11-19 14:15:11,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734021388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:11,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851149882] [2024-11-19 14:15:11,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:11,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:11,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:11,583 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:11,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2024-11-19 14:15:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:11,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:15:11,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 159 proven. 3 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-11-19 14:15:11,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 45 proven. 11 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2024-11-19 14:15:11,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851149882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:11,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:11,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2024-11-19 14:15:11,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868045434] [2024-11-19 14:15:11,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:12,166 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:12,167 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:12,167 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:12,167 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:12,167 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:12,167 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,167 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:12,168 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:12,168 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2024-11-19 14:15:12,168 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:12,168 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:12,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,251 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:12,251 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:12,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,252 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-19 14:15:12,253 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-19 14:15:12,254 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:12,254 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:12,265 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:12,265 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-19 14:15:12,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2024-11-19 14:15:12,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,277 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-19 14:15:12,277 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-19 14:15:12,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:12,278 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:12,289 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:12,289 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-19 14:15:12,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2024-11-19 14:15:12,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,301 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-19 14:15:12,302 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-19 14:15:12,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:12,303 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:12,314 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:12,314 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-19 14:15:12,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-11-19 14:15:12,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,326 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-19 14:15:12,326 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-19 14:15:12,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:12,327 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:12,338 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:12,338 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-19 14:15:12,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-11-19 14:15:12,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,350 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-19 14:15:12,351 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-19 14:15:12,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:12,352 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:12,362 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:12,362 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-19 14:15:12,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2024-11-19 14:15:12,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,374 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-19 14:15:12,375 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-19 14:15:12,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:12,376 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:12,386 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:12,386 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-19 14:15:12,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2024-11-19 14:15:12,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,398 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-19 14:15:12,399 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-19 14:15:12,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:12,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:12,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-11-19 14:15:12,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,423 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-19 14:15:12,423 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-19 14:15:12,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:12,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:12,436 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:12,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-11-19 14:15:12,446 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:12,446 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:12,447 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:12,447 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:12,447 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:12,447 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,447 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:12,447 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:12,447 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2024-11-19 14:15:12,447 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:12,447 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:12,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:12,546 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:12,546 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:12,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,548 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-19 14:15:12,550 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-19 14:15:12,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:12,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:12,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:12,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:12,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:12,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:12,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:12,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:12,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:12,578 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-19 14:15:12,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,579 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-19 14:15:12,580 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-19 14:15:12,581 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-19 14:15:12,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:12,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:12,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:12,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:12,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:12,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:12,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:12,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:12,603 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-19 14:15:12,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,605 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-19 14:15:12,606 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-19 14:15:12,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:12,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:12,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:12,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:12,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:12,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:12,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:12,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:12,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:12,629 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-19 14:15:12,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,631 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-19 14:15:12,631 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-19 14:15:12,632 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-19 14:15:12,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:12,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:12,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:12,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:12,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:12,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:12,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:12,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:12,656 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-19 14:15:12,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,658 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-19 14:15:12,659 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-19 14:15:12,659 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-19 14:15:12,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:12,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:12,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:12,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:12,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:12,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:12,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:12,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:12,682 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-19 14:15:12,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,683 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-19 14:15:12,684 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-19 14:15:12,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:12,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:12,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:12,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:12,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:12,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:12,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:12,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:12,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:12,706 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-19 14:15:12,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,708 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-19 14:15:12,708 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-19 14:15:12,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:12,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:12,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:12,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:12,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:12,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:12,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:12,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:12,722 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:12,724 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:12,724 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:12,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:12,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:12,725 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-19 14:15:12,726 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-19 14:15:12,727 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:12,727 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:12,727 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:12,727 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-19 14:15:12,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-11-19 14:15:12,737 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:12,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:12,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 14:15:12,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:13,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 14:15:13,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:13,335 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-19 14:15:13,336 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-19 14:15:13,336 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 668 states and 914 transitions. cyclomatic complexity: 262 Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-19 14:15:13,626 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 668 states and 914 transitions. cyclomatic complexity: 262. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Result 1185 states and 1567 transitions. Complement of second has 61 states. [2024-11-19 14:15:13,626 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-19 14:15:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-19 14:15:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2024-11-19 14:15:13,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 73 transitions. Stem has 55 letters. Loop has 44 letters. [2024-11-19 14:15:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:13,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 73 transitions. Stem has 99 letters. Loop has 44 letters. [2024-11-19 14:15:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 73 transitions. Stem has 55 letters. Loop has 88 letters. [2024-11-19 14:15:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:13,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1185 states and 1567 transitions. [2024-11-19 14:15:13,639 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 96 [2024-11-19 14:15:13,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1185 states to 1009 states and 1345 transitions. [2024-11-19 14:15:13,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2024-11-19 14:15:13,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2024-11-19 14:15:13,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1009 states and 1345 transitions. [2024-11-19 14:15:13,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:13,648 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1009 states and 1345 transitions. [2024-11-19 14:15:13,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states and 1345 transitions. [2024-11-19 14:15:13,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 844. [2024-11-19 14:15:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 546 states have (on average 1.1318681318681318) internal successors, (618), 543 states have internal predecessors, (618), 184 states have call successors, (190), 106 states have call predecessors, (190), 114 states have return successors, (336), 194 states have call predecessors, (336), 184 states have call successors, (336) [2024-11-19 14:15:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1144 transitions. [2024-11-19 14:15:13,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 844 states and 1144 transitions. [2024-11-19 14:15:13,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:13,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 14:15:13,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-19 14:15:13,670 INFO L87 Difference]: Start difference. First operand 844 states and 1144 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-19 14:15:13,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:13,811 INFO L93 Difference]: Finished difference Result 858 states and 1144 transitions. [2024-11-19 14:15:13,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 858 states and 1144 transitions. [2024-11-19 14:15:13,817 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 96 [2024-11-19 14:15:13,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 858 states to 818 states and 1082 transitions. [2024-11-19 14:15:13,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 284 [2024-11-19 14:15:13,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 284 [2024-11-19 14:15:13,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 818 states and 1082 transitions. [2024-11-19 14:15:13,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:13,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 818 states and 1082 transitions. [2024-11-19 14:15:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states and 1082 transitions. [2024-11-19 14:15:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 808. [2024-11-19 14:15:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 528 states have (on average 1.1098484848484849) internal successors, (586), 525 states have internal predecessors, (586), 168 states have call successors, (174), 98 states have call predecessors, (174), 112 states have return successors, (310), 184 states have call predecessors, (310), 168 states have call successors, (310) [2024-11-19 14:15:13,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1070 transitions. [2024-11-19 14:15:13,842 INFO L240 hiAutomatonCegarLoop]: Abstraction has 808 states and 1070 transitions. [2024-11-19 14:15:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 14:15:13,843 INFO L425 stractBuchiCegarLoop]: Abstraction has 808 states and 1070 transitions. [2024-11-19 14:15:13,843 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-19 14:15:13,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 808 states and 1070 transitions. [2024-11-19 14:15:13,847 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 96 [2024-11-19 14:15:13,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:13,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:13,848 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, 1] [2024-11-19 14:15:13,848 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-19 14:15:13,849 INFO L745 eck$LassoCheckResult]: Stem: 27939#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 27882#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; 27883#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; 27907#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; 27895#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 27896#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28072#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; 27872#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27873#$Ultimate##0 ~n := #in~n; 28123#L25 assume ~n <= 0;#res := 1; 28120#factFINAL assume true; 28081#factEXIT >#72#return; 27927#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27928#$Ultimate##0 ~n := #in~n; 28139#L25 assume ~n <= 0;#res := 1; 28137#factFINAL assume true; 28135#factEXIT >#74#return; 27868#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27869#$Ultimate##0 ~n := #in~n; 28140#L25 assume ~n <= 0;#res := 1; 28138#factFINAL assume true; 28136#factEXIT >#76#return; 27900#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; 27901#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; 27915#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28367#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27911#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; 27912#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28361#$Ultimate##0 ~n := #in~n; 28380#L25 assume !(~n <= 0); 28373#L26 call #t~ret0 := fact(~n - 1);< 28376#$Ultimate##0 ~n := #in~n; 28388#L25 assume ~n <= 0;#res := 1; 28384#factFINAL assume true; 28381#factEXIT >#70#return; 28363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28360#factFINAL assume true; 28357#factEXIT >#78#return; 28208#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28362#$Ultimate##0 ~n := #in~n; 28368#L25 assume ~n <= 0;#res := 1; 28207#factFINAL assume true; 28209#factEXIT >#80#return; 28358#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28359#$Ultimate##0 ~n := #in~n; 28379#L25 assume !(~n <= 0); 28365#L26 call #t~ret0 := fact(~n - 1);< 28366#$Ultimate##0 ~n := #in~n; 28387#L25 assume ~n <= 0;#res := 1; 28392#factFINAL assume true; 28364#factEXIT >#70#return; 28363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28360#factFINAL assume true; 28357#factEXIT >#82#return; 27884#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; 27885#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; 27909#L42-2 [2024-11-19 14:15:13,849 INFO L747 eck$LassoCheckResult]: Loop: 27909#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 27920#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27921#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; 27852#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27853#$Ultimate##0 ~n := #in~n; 28473#L25 assume !(~n <= 0); 27858#L26 call #t~ret0 := fact(~n - 1);< 27890#$Ultimate##0 ~n := #in~n; 28477#L25 assume !(~n <= 0); 27877#L26 call #t~ret0 := fact(~n - 1);< 28476#$Ultimate##0 ~n := #in~n; 28477#L25 assume !(~n <= 0); 27877#L26 call #t~ret0 := fact(~n - 1);< 28476#$Ultimate##0 ~n := #in~n; 27923#L25 assume ~n <= 0;#res := 1; 27876#factFINAL assume true; 27878#factEXIT >#70#return; 28481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28480#factFINAL assume true; 28479#factEXIT >#70#return; 28471#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28475#factFINAL assume true; 28470#factEXIT >#70#return; 28469#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28467#factFINAL assume true; 28465#factEXIT >#78#return; 27935#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27936#$Ultimate##0 ~n := #in~n; 28216#L25 assume ~n <= 0;#res := 1; 28217#factFINAL assume true; 28202#factEXIT >#80#return; 27917#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28466#$Ultimate##0 ~n := #in~n; 28472#L25 assume !(~n <= 0); 27858#L26 call #t~ret0 := fact(~n - 1);< 27890#$Ultimate##0 ~n := #in~n; 28477#L25 assume !(~n <= 0); 27877#L26 call #t~ret0 := fact(~n - 1);< 28476#$Ultimate##0 ~n := #in~n; 28477#L25 assume !(~n <= 0); 27877#L26 call #t~ret0 := fact(~n - 1);< 28476#$Ultimate##0 ~n := #in~n; 27923#L25 assume ~n <= 0;#res := 1; 27876#factFINAL assume true; 27878#factEXIT >#70#return; 28481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28480#factFINAL assume true; 28479#factEXIT >#70#return; 28471#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28475#factFINAL assume true; 28470#factEXIT >#70#return; 28469#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28467#factFINAL assume true; 28465#factEXIT >#82#return; 28128#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; 27908#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; 27909#L42-2 [2024-11-19 14:15:13,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1169473323, now seen corresponding path program 2 times [2024-11-19 14:15:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:13,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624807450] [2024-11-19 14:15:13,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:13,861 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:13,862 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:15:13,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352204429] [2024-11-19 14:15:13,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:13,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:13,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:13,865 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:13,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2024-11-19 14:15:13,935 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:13,935 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:13,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:13,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:13,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash -604852548, now seen corresponding path program 3 times [2024-11-19 14:15:13,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:13,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248008324] [2024-11-19 14:15:13,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:13,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:13,984 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 14:15:13,984 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:15:13,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076542011] [2024-11-19 14:15:13,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:13,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:13,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:13,987 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:13,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2024-11-19 14:15:14,143 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 14:15:14,144 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:14,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:14,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:14,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:14,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1511351184, now seen corresponding path program 3 times [2024-11-19 14:15:14,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:14,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355544481] [2024-11-19 14:15:14,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:14,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:14,232 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-19 14:15:14,232 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 164 proven. 15 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2024-11-19 14:15:14,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:14,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355544481] [2024-11-19 14:15:14,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355544481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:14,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974106008] [2024-11-19 14:15:14,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:14,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:14,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:14,420 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:14,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2024-11-19 14:15:14,520 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-19 14:15:14,520 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:14,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:15:14,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 373 proven. 13 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-19 14:15:14,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 103 proven. 80 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-11-19 14:15:14,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974106008] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:14,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:14,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 18 [2024-11-19 14:15:14,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069801474] [2024-11-19 14:15:14,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:15,366 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:15,366 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:15,366 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:15,366 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:15,366 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:15,367 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,367 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:15,367 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:15,367 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2024-11-19 14:15:15,367 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:15,367 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:15,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,443 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:15,444 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:15,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:15,445 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-19 14:15:15,446 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-19 14:15:15,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:15,447 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:15,457 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:15,458 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-19 14:15:15,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2024-11-19 14:15:15,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:15,469 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-19 14:15:15,470 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-19 14:15:15,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:15,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:15,481 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:15,481 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-19 14:15:15,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:15,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:15,493 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-19 14:15:15,493 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-19 14:15:15,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:15,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:15,505 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:15,505 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-19 14:15:15,515 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-19 14:15:15,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:15,516 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-19 14:15:15,517 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-19 14:15:15,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:15,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:15,528 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:15,529 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-19 14:15:15,539 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-19 14:15:15,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:15,540 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-19 14:15:15,541 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-19 14:15:15,542 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:15,542 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:15,553 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:15,553 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-19 14:15:15,562 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-19 14:15:15,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:15,564 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:15,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-11-19 14:15:15,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:15,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:15,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2024-11-19 14:15:15,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:15,594 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/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-19 14:15:15,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-11-19 14:15:15,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:15,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:15,607 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:15,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2024-11-19 14:15:15,618 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:15,618 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:15,618 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:15,618 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:15,618 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:15,618 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,618 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:15,618 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:15,618 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2024-11-19 14:15:15,618 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:15,619 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:15,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:15,677 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:15,677 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:15,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:15,678 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:15,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-11-19 14:15:15,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:15,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:15,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:15,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:15,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:15,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:15,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:15,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:15,692 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:15,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-11-19 14:15:15,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:15,703 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:15,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-11-19 14:15:15,705 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-19 14:15:15,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:15,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:15,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:15,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:15,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:15,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:15,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:15,717 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:15,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2024-11-19 14:15:15,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:15,728 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:15,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-11-19 14:15:15,730 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-19 14:15:15,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:15,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:15,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:15,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:15,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:15,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:15,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:15,742 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:15,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-11-19 14:15:15,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:15,753 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-19 14:15:15,754 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-19 14:15:15,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:15,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:15,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:15,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:15,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:15,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:15,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:15,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:15,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:15,776 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-19 14:15:15,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:15,778 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-19 14:15:15,779 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-19 14:15:15,780 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-19 14:15:15,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:15,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:15,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:15,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:15,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:15,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:15,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:15,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:15,802 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-19 14:15:15,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:15,804 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-19 14:15:15,804 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-19 14:15:15,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:15,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:15,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:15,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:15,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:15,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:15,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:15,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:15,818 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:15,820 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:15,820 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:15,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:15,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:15,821 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-19 14:15:15,822 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-19 14:15:15,822 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:15,823 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:15,823 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:15,823 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-19 14:15:15,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:15,834 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:15,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:15,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 14:15:15,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:16,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 14:15:16,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:16,454 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-19 14:15:16,454 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-19 14:15:16,455 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 808 states and 1070 transitions. cyclomatic complexity: 282 Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 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-19 14:15:16,788 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 808 states and 1070 transitions. cyclomatic complexity: 282. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 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 1763 states and 2245 transitions. Complement of second has 69 states. [2024-11-19 14:15:16,789 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-19 14:15:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 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-19 14:15:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2024-11-19 14:15:16,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 78 transitions. Stem has 56 letters. Loop has 56 letters. [2024-11-19 14:15:16,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:16,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 78 transitions. Stem has 112 letters. Loop has 56 letters. [2024-11-19 14:15:16,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:16,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 78 transitions. Stem has 56 letters. Loop has 112 letters. [2024-11-19 14:15:16,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:16,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1763 states and 2245 transitions. [2024-11-19 14:15:16,807 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 96 [2024-11-19 14:15:16,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1763 states to 1369 states and 1759 transitions. [2024-11-19 14:15:16,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 326 [2024-11-19 14:15:16,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 329 [2024-11-19 14:15:16,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1369 states and 1759 transitions. [2024-11-19 14:15:16,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:16,819 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1369 states and 1759 transitions. [2024-11-19 14:15:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states and 1759 transitions. [2024-11-19 14:15:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1048. [2024-11-19 14:15:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 690 states have (on average 1.1) internal successors, (759), 686 states have internal predecessors, (759), 195 states have call successors, (209), 129 states have call predecessors, (209), 163 states have return successors, (405), 232 states have call predecessors, (405), 195 states have call successors, (405) [2024-11-19 14:15:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1373 transitions. [2024-11-19 14:15:16,851 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1048 states and 1373 transitions. [2024-11-19 14:15:16,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:16,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 14:15:16,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-19 14:15:16,852 INFO L87 Difference]: Start difference. First operand 1048 states and 1373 transitions. Second operand has 18 states, 16 states have (on average 3.625) internal successors, (58), 18 states have internal predecessors, (58), 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-19 14:15:17,342 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-19 14:15:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:17,534 INFO L93 Difference]: Finished difference Result 1592 states and 2284 transitions. [2024-11-19 14:15:17,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1592 states and 2284 transitions. [2024-11-19 14:15:17,545 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 194 [2024-11-19 14:15:17,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1592 states to 1562 states and 2246 transitions. [2024-11-19 14:15:17,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 493 [2024-11-19 14:15:17,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 493 [2024-11-19 14:15:17,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1562 states and 2246 transitions. [2024-11-19 14:15:17,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:17,559 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1562 states and 2246 transitions. [2024-11-19 14:15:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states and 2246 transitions. [2024-11-19 14:15:17,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1302. [2024-11-19 14:15:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 848 states have (on average 1.0943396226415094) internal successors, (928), 848 states have internal predecessors, (928), 274 states have call successors, (298), 129 states have call predecessors, (298), 180 states have return successors, (619), 324 states have call predecessors, (619), 274 states have call successors, (619) [2024-11-19 14:15:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1845 transitions. [2024-11-19 14:15:17,601 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1302 states and 1845 transitions. [2024-11-19 14:15:17,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 14:15:17,602 INFO L425 stractBuchiCegarLoop]: Abstraction has 1302 states and 1845 transitions. [2024-11-19 14:15:17,602 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-19 14:15:17,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1302 states and 1845 transitions. [2024-11-19 14:15:17,608 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 143 [2024-11-19 14:15:17,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:17,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:17,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 13, 9, 4, 4, 4, 4, 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-19 14:15:17,609 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-19 14:15:17,610 INFO L745 eck$LassoCheckResult]: Stem: 34310#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 34249#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; 34250#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; 34275#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; 34262#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 34263#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 34608#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; 34245#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 34246#$Ultimate##0 ~n := #in~n; 34491#L25 assume ~n <= 0;#res := 1; 34489#factFINAL assume true; 34487#factEXIT >#72#return; 34297#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 34298#$Ultimate##0 ~n := #in~n; 34563#L25 assume ~n <= 0;#res := 1; 34562#factFINAL assume true; 34561#factEXIT >#74#return; 34236#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 34237#$Ultimate##0 ~n := #in~n; 34601#L25 assume ~n <= 0;#res := 1; 34600#factFINAL assume true; 34599#factEXIT >#76#return; 34598#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; 34597#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; 34596#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 34595#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 34594#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; 34224#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 34225#$Ultimate##0 ~n := #in~n; 34507#L25 assume !(~n <= 0); 34508#L26 call #t~ret0 := fact(~n - 1);< 34813#$Ultimate##0 ~n := #in~n; 34549#L25 assume ~n <= 0;#res := 1; 34546#factFINAL assume true; 34547#factEXIT >#70#return; 34501#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34492#factFINAL assume true; 34494#factEXIT >#78#return; 34498#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 34502#$Ultimate##0 ~n := #in~n; 34500#L25 assume ~n <= 0;#res := 1; 34497#factFINAL assume true; 34499#factEXIT >#80#return; 34493#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 34495#$Ultimate##0 ~n := #in~n; 34814#L25 assume !(~n <= 0); 34504#L26 call #t~ret0 := fact(~n - 1);< 34505#$Ultimate##0 ~n := #in~n; 34558#L25 assume ~n <= 0;#res := 1; 34815#factFINAL assume true; 34503#factEXIT >#70#return; 34501#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34492#factFINAL assume true; 34494#factEXIT >#82#return; 34803#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; 34790#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; 34703#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 34701#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 34702#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; 34681#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 34684#$Ultimate##0 ~n := #in~n; 34782#L25 assume !(~n <= 0); 34736#L26 call #t~ret0 := fact(~n - 1);< 34739#$Ultimate##0 ~n := #in~n; 34751#L25 assume ~n <= 0;#res := 1; 34742#factFINAL assume true; 34735#factEXIT >#70#return; 34726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34723#factFINAL assume true; 34679#factEXIT >#78#return; 34288#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 34621#$Ultimate##0 ~n := #in~n; 34286#L25 assume ~n <= 0;#res := 1; 34289#factFINAL assume true; 34607#factEXIT >#80#return; 34256#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 34311#$Ultimate##0 ~n := #in~n; 34512#L25 assume !(~n <= 0); 34255#L26 call #t~ret0 := fact(~n - 1);< 34258#$Ultimate##0 ~n := #in~n; 34531#L25 assume ~n <= 0;#res := 1; 34560#factFINAL assume true; 34559#factEXIT >#70#return; 34536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34544#factFINAL assume true; 34545#factEXIT >#82#return; 34473#L30-8 [2024-11-19 14:15:17,610 INFO L747 eck$LassoCheckResult]: Loop: 34473#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; 34537#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; 34515#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 34514#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 34513#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; 34471#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 34506#$Ultimate##0 ~n := #in~n; 34509#L25 assume !(~n <= 0); 34511#L26 call #t~ret0 := fact(~n - 1);< 34258#$Ultimate##0 ~n := #in~n; 34528#L25 assume !(~n <= 0); 34521#L26 call #t~ret0 := fact(~n - 1);< 34526#$Ultimate##0 ~n := #in~n; 34528#L25 assume !(~n <= 0); 34521#L26 call #t~ret0 := fact(~n - 1);< 34526#$Ultimate##0 ~n := #in~n; 34528#L25 assume !(~n <= 0); 34521#L26 call #t~ret0 := fact(~n - 1);< 34526#$Ultimate##0 ~n := #in~n; 34532#L25 assume ~n <= 0;#res := 1; 34541#factFINAL assume true; 34540#factEXIT >#70#return; 34539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34538#factFINAL assume true; 34535#factEXIT >#70#return; 34534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34533#factFINAL assume true; 34529#factEXIT >#70#return; 34522#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34525#factFINAL assume true; 34520#factEXIT >#70#return; 34519#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34517#factFINAL assume true; 34470#factEXIT >#78#return; 34304#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 34305#$Ultimate##0 ~n := #in~n; 34524#L25 assume ~n <= 0;#res := 1; 34510#factFINAL assume true; 34496#factEXIT >#80#return; 34472#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 34518#$Ultimate##0 ~n := #in~n; 34527#L25 assume !(~n <= 0); 34511#L26 call #t~ret0 := fact(~n - 1);< 34258#$Ultimate##0 ~n := #in~n; 34528#L25 assume !(~n <= 0); 34521#L26 call #t~ret0 := fact(~n - 1);< 34526#$Ultimate##0 ~n := #in~n; 34528#L25 assume !(~n <= 0); 34521#L26 call #t~ret0 := fact(~n - 1);< 34526#$Ultimate##0 ~n := #in~n; 34528#L25 assume !(~n <= 0); 34521#L26 call #t~ret0 := fact(~n - 1);< 34526#$Ultimate##0 ~n := #in~n; 34532#L25 assume ~n <= 0;#res := 1; 34541#factFINAL assume true; 34540#factEXIT >#70#return; 34539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34538#factFINAL assume true; 34535#factEXIT >#70#return; 34534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34533#factFINAL assume true; 34529#factEXIT >#70#return; 34522#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34525#factFINAL assume true; 34520#factEXIT >#70#return; 34519#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34517#factFINAL assume true; 34470#factEXIT >#82#return; 34473#L30-8 [2024-11-19 14:15:17,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:17,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1958623442, now seen corresponding path program 4 times [2024-11-19 14:15:17,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:17,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400352053] [2024-11-19 14:15:17,611 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:17,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:17,622 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:17,622 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 61 proven. 24 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2024-11-19 14:15:17,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:17,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400352053] [2024-11-19 14:15:17,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400352053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:17,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023991299] [2024-11-19 14:15:17,742 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:17,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:17,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:17,744 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:17,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2024-11-19 14:15:17,821 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:17,821 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:17,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:15:17,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 187 proven. 3 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-19 14:15:17,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 61 proven. 24 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2024-11-19 14:15:18,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023991299] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:18,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:18,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 13 [2024-11-19 14:15:18,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898038732] [2024-11-19 14:15:18,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:18,054 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:18,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1739714684, now seen corresponding path program 4 times [2024-11-19 14:15:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:18,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908695923] [2024-11-19 14:15:18,054 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:18,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:18,067 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:18,067 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:15:18,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [464743503] [2024-11-19 14:15:18,068 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:18,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:18,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:18,070 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:18,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2024-11-19 14:15:18,162 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:18,162 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:18,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:18,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:18,699 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:18,700 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:18,700 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:18,700 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:18,700 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:18,700 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:18,700 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:18,700 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:18,700 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2024-11-19 14:15:18,700 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:18,700 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:18,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:18,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:18,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:18,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:18,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:18,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:18,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:18,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:18,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:18,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:18,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:18,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:18,799 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:18,799 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:18,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:18,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:18,801 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-19 14:15:18,801 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-19 14:15:18,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:18,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:18,813 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:18,813 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-19 14:15:18,824 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-19 14:15:18,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:18,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:18,825 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-19 14:15:18,826 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-19 14:15:18,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:18,827 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:18,838 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:18,838 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-19 14:15:18,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:18,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:18,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:18,850 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-19 14:15:18,852 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-19 14:15:18,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:18,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:18,864 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:18,864 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-19 14:15:18,874 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-19 14:15:18,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:18,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:18,876 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-19 14:15:18,877 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-19 14:15:18,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:18,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:18,888 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:18,888 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-19 14:15:18,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2024-11-19 14:15:18,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:18,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:18,900 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-19 14:15:18,900 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-19 14:15:18,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:18,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:18,912 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:18,912 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=24} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:15:18,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2024-11-19 14:15:18,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:18,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:18,923 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-19 14:15:18,924 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-19 14:15:18,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:18,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:18,936 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:18,936 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-19 14:15:18,946 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-19 14:15:18,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:18,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:18,948 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-19 14:15:18,948 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-19 14:15:18,949 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:18,949 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:18,970 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-19 14:15:18,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:18,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:18,971 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-19 14:15:18,972 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-19 14:15:18,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:18,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:18,984 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:18,995 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-19 14:15:18,995 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:18,995 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:18,995 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:18,995 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:18,995 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:18,995 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:18,995 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:18,995 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:18,995 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2024-11-19 14:15:18,995 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:18,995 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:19,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:19,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:19,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:19,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:19,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:19,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:19,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:19,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:19,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:19,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:19,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:19,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:19,102 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:19,102 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:19,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:19,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:19,103 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-19 14:15:19,104 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-19 14:15:19,105 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-19 14:15:19,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:19,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:19,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:19,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:19,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:19,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:19,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:19,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:19,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2024-11-19 14:15:19,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:19,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:19,128 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-19 14:15:19,129 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-19 14:15:19,129 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-19 14:15:19,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:19,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:19,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:19,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:19,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:19,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:19,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:19,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:19,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2024-11-19 14:15:19,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:19,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:19,153 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-19 14:15:19,154 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-19 14:15:19,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:19,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:19,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:19,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:19,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:19,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:19,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:19,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:19,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:19,177 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-19 14:15:19,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:19,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:19,178 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-19 14:15:19,179 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-19 14:15:19,180 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-19 14:15:19,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:19,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:19,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:19,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:19,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:19,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:19,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:19,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:19,202 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-19 14:15:19,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:19,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:19,204 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-19 14:15:19,204 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-19 14:15:19,205 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-19 14:15:19,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:19,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:19,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:19,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:19,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:19,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:19,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:19,217 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:19,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2024-11-19 14:15:19,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:19,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:19,228 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-19 14:15:19,229 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-19 14:15:19,230 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-19 14:15:19,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:19,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:19,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:19,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:19,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:19,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:19,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:19,242 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:19,243 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:19,243 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:19,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:19,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:19,246 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-19 14:15:19,246 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-19 14:15:19,247 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:19,247 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:19,247 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:19,247 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-19 14:15:19,257 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-19 14:15:19,258 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:19,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:19,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 14:15:19,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:19,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-19 14:15:19,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:20,123 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-19 14:15:20,124 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-19 14:15:20,124 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1302 states and 1845 transitions. cyclomatic complexity: 569 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-19 14:15:20,497 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1302 states and 1845 transitions. cyclomatic complexity: 569. 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 2771 states and 3702 transitions. Complement of second has 81 states. [2024-11-19 14:15:20,498 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-19 14:15:20,498 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-19 14:15:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2024-11-19 14:15:20,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 82 transitions. Stem has 86 letters. Loop has 68 letters. [2024-11-19 14:15:20,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:20,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 82 transitions. Stem has 154 letters. Loop has 68 letters. [2024-11-19 14:15:20,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:20,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 82 transitions. Stem has 86 letters. Loop has 136 letters. [2024-11-19 14:15:20,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:20,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2771 states and 3702 transitions. [2024-11-19 14:15:20,521 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 143 [2024-11-19 14:15:20,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2771 states to 1956 states and 2671 transitions. [2024-11-19 14:15:20,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 429 [2024-11-19 14:15:20,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 433 [2024-11-19 14:15:20,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1956 states and 2671 transitions. [2024-11-19 14:15:20,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:20,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1956 states and 2671 transitions. [2024-11-19 14:15:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states and 2671 transitions. [2024-11-19 14:15:20,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1622. [2024-11-19 14:15:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1053 states have (on average 1.0816714150047484) internal successors, (1139), 1054 states have internal predecessors, (1139), 321 states have call successors, (358), 168 states have call predecessors, (358), 248 states have return successors, (796), 399 states have call predecessors, (796), 321 states have call successors, (796) [2024-11-19 14:15:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2293 transitions. [2024-11-19 14:15:20,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1622 states and 2293 transitions. [2024-11-19 14:15:20,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:20,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 14:15:20,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-19 14:15:20,605 INFO L87 Difference]: Start difference. First operand 1622 states and 2293 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-19 14:15:20,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:20,885 INFO L93 Difference]: Finished difference Result 1545 states and 2106 transitions. [2024-11-19 14:15:20,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1545 states and 2106 transitions. [2024-11-19 14:15:20,895 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 117 [2024-11-19 14:15:20,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1545 states to 1329 states and 1816 transitions. [2024-11-19 14:15:20,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 376 [2024-11-19 14:15:20,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 376 [2024-11-19 14:15:20,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1329 states and 1816 transitions. [2024-11-19 14:15:20,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:20,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1329 states and 1816 transitions. [2024-11-19 14:15:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states and 1816 transitions. [2024-11-19 14:15:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1249. [2024-11-19 14:15:20,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 823 states have (on average 1.0814094775212637) internal successors, (890), 822 states have internal predecessors, (890), 240 states have call successors, (258), 130 states have call predecessors, (258), 186 states have return successors, (574), 296 states have call predecessors, (574), 240 states have call successors, (574) [2024-11-19 14:15:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1722 transitions. [2024-11-19 14:15:20,943 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1249 states and 1722 transitions. [2024-11-19 14:15:20,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 14:15:20,944 INFO L425 stractBuchiCegarLoop]: Abstraction has 1249 states and 1722 transitions. [2024-11-19 14:15:20,944 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-19 14:15:20,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1249 states and 1722 transitions. [2024-11-19 14:15:20,948 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 113 [2024-11-19 14:15:20,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:20,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:20,949 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 14, 9, 5, 5, 5, 5, 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-19 14:15:20,950 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-19 14:15:20,950 INFO L745 eck$LassoCheckResult]: Stem: 42650#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 42595#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; 42596#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; 42616#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; 42651#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 42745#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42744#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; 42725#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42726#$Ultimate##0 ~n := #in~n; 42742#L25 assume ~n <= 0;#res := 1; 42741#factFINAL assume true; 42724#factEXIT >#72#return; 42721#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42722#$Ultimate##0 ~n := #in~n; 42737#L25 assume ~n <= 0;#res := 1; 42735#factFINAL assume true; 42720#factEXIT >#74#return; 42712#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42713#$Ultimate##0 ~n := #in~n; 42719#L25 assume ~n <= 0;#res := 1; 42718#factFINAL assume true; 42711#factEXIT >#76#return; 42709#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; 42708#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; 42707#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 42704#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42698#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; 42690#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42694#$Ultimate##0 ~n := #in~n; 42734#L25 assume !(~n <= 0); 42715#L26 call #t~ret0 := fact(~n - 1);< 42717#$Ultimate##0 ~n := #in~n; 42739#L25 assume ~n <= 0;#res := 1; 42738#factFINAL assume true; 42736#factEXIT >#70#return; 42697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42693#factFINAL assume true; 42688#factEXIT >#78#return; 42691#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42696#$Ultimate##0 ~n := #in~n; 42705#L25 assume ~n <= 0;#res := 1; 42699#factFINAL assume true; 42695#factEXIT >#80#return; 42689#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42692#$Ultimate##0 ~n := #in~n; 42730#L25 assume !(~n <= 0); 42702#L26 call #t~ret0 := fact(~n - 1);< 42703#$Ultimate##0 ~n := #in~n; 42732#L25 assume ~n <= 0;#res := 1; 42740#factFINAL assume true; 42701#factEXIT >#70#return; 42697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42693#factFINAL assume true; 42688#factEXIT >#82#return; 42597#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; 42598#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; 43016#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 43015#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43014#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; 42978#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42979#$Ultimate##0 ~n := #in~n; 43003#L25 assume !(~n <= 0); 42991#L26 call #t~ret0 := fact(~n - 1);< 43112#$Ultimate##0 ~n := #in~n; 43114#L25 assume !(~n <= 0); 42989#L26 call #t~ret0 := fact(~n - 1);< 43050#$Ultimate##0 ~n := #in~n; 43125#L25 assume ~n <= 0;#res := 1; 43124#factFINAL assume true; 43120#factEXIT >#70#return; 43116#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43110#factFINAL assume true; 42988#factEXIT >#70#return; 42995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43139#factFINAL assume true; 43129#factEXIT >#78#return; 43130#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43165#$Ultimate##0 ~n := #in~n; 43176#L25 assume ~n <= 0;#res := 1; 43175#factFINAL assume true; 43174#factEXIT >#80#return; 42686#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42687#$Ultimate##0 ~n := #in~n; 42881#L25 assume !(~n <= 0); 42883#L26 call #t~ret0 := fact(~n - 1);< 42602#$Ultimate##0 ~n := #in~n; 42959#L25 assume ~n <= 0;#res := 1; 42967#factFINAL assume true; 42966#factEXIT >#70#return; 42958#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43814#factFINAL assume true; 43770#factEXIT >#82#return; 42905#L30-8 [2024-11-19 14:15:20,950 INFO L747 eck$LassoCheckResult]: Loop: 42905#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; 42904#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; 42903#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 42902#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42901#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; 42572#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42573#$Ultimate##0 ~n := #in~n; 42944#L25 assume !(~n <= 0); 42939#L26 call #t~ret0 := fact(~n - 1);< 42602#$Ultimate##0 ~n := #in~n; 42956#L25 assume !(~n <= 0); 42938#L26 call #t~ret0 := fact(~n - 1);< 42946#$Ultimate##0 ~n := #in~n; 42956#L25 assume !(~n <= 0); 42938#L26 call #t~ret0 := fact(~n - 1);< 42946#$Ultimate##0 ~n := #in~n; 42956#L25 assume !(~n <= 0); 42938#L26 call #t~ret0 := fact(~n - 1);< 42946#$Ultimate##0 ~n := #in~n; 42956#L25 assume !(~n <= 0); 42938#L26 call #t~ret0 := fact(~n - 1);< 42946#$Ultimate##0 ~n := #in~n; 42960#L25 assume ~n <= 0;#res := 1; 42964#factFINAL assume true; 42963#factEXIT >#70#return; 42962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42961#factFINAL assume true; 42957#factEXIT >#70#return; 42955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42954#factFINAL assume true; 42953#factEXIT >#70#return; 42952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42951#factFINAL assume true; 42947#factEXIT >#70#return; 42940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42945#factFINAL assume true; 42937#factEXIT >#70#return; 42934#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42932#factFINAL assume true; 42931#factEXIT >#78#return; 42645#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42646#$Ultimate##0 ~n := #in~n; 42943#L25 assume ~n <= 0;#res := 1; 42942#factFINAL assume true; 42935#factEXIT >#80#return; 42907#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42933#$Ultimate##0 ~n := #in~n; 42950#L25 assume !(~n <= 0); 42939#L26 call #t~ret0 := fact(~n - 1);< 42602#$Ultimate##0 ~n := #in~n; 42956#L25 assume !(~n <= 0); 42938#L26 call #t~ret0 := fact(~n - 1);< 42946#$Ultimate##0 ~n := #in~n; 42956#L25 assume !(~n <= 0); 42938#L26 call #t~ret0 := fact(~n - 1);< 42946#$Ultimate##0 ~n := #in~n; 42956#L25 assume !(~n <= 0); 42938#L26 call #t~ret0 := fact(~n - 1);< 42946#$Ultimate##0 ~n := #in~n; 42956#L25 assume !(~n <= 0); 42938#L26 call #t~ret0 := fact(~n - 1);< 42946#$Ultimate##0 ~n := #in~n; 42960#L25 assume ~n <= 0;#res := 1; 42964#factFINAL assume true; 42963#factEXIT >#70#return; 42962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42961#factFINAL assume true; 42957#factEXIT >#70#return; 42955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42954#factFINAL assume true; 42953#factEXIT >#70#return; 42952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42951#factFINAL assume true; 42947#factEXIT >#70#return; 42940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42945#factFINAL assume true; 42937#factEXIT >#70#return; 42934#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42932#factFINAL assume true; 42931#factEXIT >#82#return; 42905#L30-8 [2024-11-19 14:15:20,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:20,951 INFO L85 PathProgramCache]: Analyzing trace with hash 844272686, now seen corresponding path program 5 times [2024-11-19 14:15:20,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:20,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279592316] [2024-11-19 14:15:20,951 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:20,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:20,966 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-19 14:15:20,967 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 103 proven. 62 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-11-19 14:15:21,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:21,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279592316] [2024-11-19 14:15:21,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279592316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:21,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187005496] [2024-11-19 14:15:21,184 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:21,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:21,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:21,186 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-19 14:15:21,186 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-19 14:15:21,296 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-19 14:15:21,296 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:21,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:15:21,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 112 proven. 43 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-11-19 14:15:21,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 112 proven. 45 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-11-19 14:15:21,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187005496] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:21,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:21,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 21 [2024-11-19 14:15:21,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020094403] [2024-11-19 14:15:21,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:21,646 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:21,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:21,647 INFO L85 PathProgramCache]: Analyzing trace with hash 757551868, now seen corresponding path program 5 times [2024-11-19 14:15:21,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:21,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617349283] [2024-11-19 14:15:21,647 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:21,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:21,668 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2024-11-19 14:15:21,668 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:15:21,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917762504] [2024-11-19 14:15:21,670 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:21,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:21,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:21,672 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-19 14:15:21,674 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-19 14:15:21,761 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2024-11-19 14:15:21,761 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:21,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:21,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:22,319 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:22,319 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:22,320 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:22,320 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:22,320 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:22,320 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,320 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:22,320 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:22,320 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2024-11-19 14:15:22,320 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:22,320 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:22,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,429 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:22,429 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:22,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,432 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/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-19 14:15:22,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2024-11-19 14:15:22,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:22,433 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:22,445 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:22,445 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-19 14:15:22,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2024-11-19 14:15:22,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,457 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-19 14:15:22,458 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-19 14:15:22,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:22,459 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:22,470 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:22,470 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-19 14:15:22,480 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-19 14:15:22,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,482 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-19 14:15:22,483 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-19 14:15:22,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:22,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:22,506 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-19 14:15:22,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,508 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-19 14:15:22,509 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-19 14:15:22,509 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:22,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:22,521 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:22,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2024-11-19 14:15:22,532 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:22,532 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:22,532 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:22,532 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:22,532 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:22,532 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,532 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:22,533 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:22,533 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2024-11-19 14:15:22,533 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:22,533 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:22,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,618 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:22,618 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:22,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,623 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-19 14:15:22,624 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-19 14:15:22,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:22,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:22,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:22,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:22,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:22,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:22,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:22,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:22,636 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:22,647 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-19 14:15:22,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,649 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-19 14:15:22,650 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-19 14:15:22,650 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-19 14:15:22,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:22,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:22,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:22,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:22,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:22,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:22,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:22,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:22,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2024-11-19 14:15:22,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,676 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-19 14:15:22,676 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-19 14:15:22,677 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-19 14:15:22,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:22,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:22,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:22,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:22,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:22,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:22,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:22,690 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:22,692 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:22,692 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:22,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,696 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-19 14:15:22,697 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-19 14:15:22,698 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:22,698 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:22,698 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:22,698 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-19 14:15:22,713 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-19 14:15:22,714 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:22,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:22,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 14:15:22,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:23,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 14:15:23,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-19 14:15:23,580 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-19 14:15:23,580 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1249 states and 1722 transitions. cyclomatic complexity: 496 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-19 14:15:24,004 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1249 states and 1722 transitions. cyclomatic complexity: 496. 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 3018 states and 3925 transitions. Complement of second has 93 states. [2024-11-19 14:15:24,004 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-19 14:15:24,005 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-19 14:15:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2024-11-19 14:15:24,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 87 transitions. Stem has 92 letters. Loop has 80 letters. [2024-11-19 14:15:24,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:24,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 87 transitions. Stem has 172 letters. Loop has 80 letters. [2024-11-19 14:15:24,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:24,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 87 transitions. Stem has 92 letters. Loop has 160 letters. [2024-11-19 14:15:24,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:24,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3018 states and 3925 transitions. [2024-11-19 14:15:24,025 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 113 [2024-11-19 14:15:24,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3018 states to 2111 states and 2782 transitions. [2024-11-19 14:15:24,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 430 [2024-11-19 14:15:24,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2024-11-19 14:15:24,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2111 states and 2782 transitions. [2024-11-19 14:15:24,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:24,043 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2111 states and 2782 transitions. [2024-11-19 14:15:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states and 2782 transitions. [2024-11-19 14:15:24,160 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-19 14:15:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1469. [2024-11-19 14:15:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 969 states have (on average 1.0753353973168214) internal successors, (1042), 968 states have internal predecessors, (1042), 264 states have call successors, (292), 156 states have call predecessors, (292), 236 states have return successors, (692), 344 states have call predecessors, (692), 264 states have call successors, (692) [2024-11-19 14:15:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2026 transitions. [2024-11-19 14:15:24,185 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1469 states and 2026 transitions. [2024-11-19 14:15:24,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:24,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 14:15:24,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2024-11-19 14:15:24,186 INFO L87 Difference]: Start difference. First operand 1469 states and 2026 transitions. Second operand has 22 states, 14 states have (on average 3.357142857142857) internal successors, (47), 19 states have internal predecessors, (47), 13 states have call successors, (20), 1 states have call predecessors, (20), 4 states have return successors, (21), 10 states have call predecessors, (21), 13 states have call successors, (21) [2024-11-19 14:15:24,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:24,678 INFO L93 Difference]: Finished difference Result 1631 states and 2162 transitions. [2024-11-19 14:15:24,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1631 states and 2162 transitions. [2024-11-19 14:15:24,689 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 132 [2024-11-19 14:15:24,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1631 states to 1511 states and 2042 transitions. [2024-11-19 14:15:24,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 403 [2024-11-19 14:15:24,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 403 [2024-11-19 14:15:24,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1511 states and 2042 transitions. [2024-11-19 14:15:24,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:24,703 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1511 states and 2042 transitions. [2024-11-19 14:15:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states and 2042 transitions. [2024-11-19 14:15:24,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1413. [2024-11-19 14:15:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 925 states have (on average 1.0572972972972974) internal successors, (978), 924 states have internal predecessors, (978), 264 states have call successors, (292), 146 states have call predecessors, (292), 224 states have return successors, (648), 342 states have call predecessors, (648), 264 states have call successors, (648) [2024-11-19 14:15:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1918 transitions. [2024-11-19 14:15:24,753 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1413 states and 1918 transitions. [2024-11-19 14:15:24,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 14:15:24,755 INFO L425 stractBuchiCegarLoop]: Abstraction has 1413 states and 1918 transitions. [2024-11-19 14:15:24,755 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-19 14:15:24,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1413 states and 1918 transitions. [2024-11-19 14:15:24,759 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 113 [2024-11-19 14:15:24,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:24,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:24,761 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-19 14:15:24,761 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-19 14:15:24,761 INFO L745 eck$LassoCheckResult]: Stem: 51261#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 51205#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; 51206#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; 51229#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; 51217#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 51218#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 51461#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; 51456#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 51457#$Ultimate##0 ~n := #in~n; 51464#L25 assume ~n <= 0;#res := 1; 51460#factFINAL assume true; 51455#factEXIT >#72#return; 51452#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 51453#$Ultimate##0 ~n := #in~n; 51472#L25 assume ~n <= 0;#res := 1; 51467#factFINAL assume true; 51451#factEXIT >#74#return; 51448#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 51449#$Ultimate##0 ~n := #in~n; 51471#L25 assume ~n <= 0;#res := 1; 51470#factFINAL assume true; 51447#factEXIT >#76#return; 51442#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; 51440#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; 51437#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 51436#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 51435#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; 51385#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 51406#$Ultimate##0 ~n := #in~n; 51468#L25 assume !(~n <= 0); 51444#L26 call #t~ret0 := fact(~n - 1);< 51446#$Ultimate##0 ~n := #in~n; 51466#L25 assume ~n <= 0;#res := 1; 51474#factFINAL assume true; 51469#factEXIT >#70#return; 51408#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51405#factFINAL assume true; 51384#factEXIT >#78#return; 51387#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 51410#$Ultimate##0 ~n := #in~n; 51431#L25 assume ~n <= 0;#res := 1; 51430#factFINAL assume true; 51409#factEXIT >#80#return; 51386#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 51388#$Ultimate##0 ~n := #in~n; 51476#L25 assume !(~n <= 0); 51412#L26 call #t~ret0 := fact(~n - 1);< 51413#$Ultimate##0 ~n := #in~n; 51475#L25 assume ~n <= 0;#res := 1; 51473#factFINAL assume true; 51411#factEXIT >#70#return; 51408#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51405#factFINAL assume true; 51384#factEXIT >#82#return; 51207#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; 51208#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; 51730#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 51728#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 51725#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; 51619#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 51620#$Ultimate##0 ~n := #in~n; 51787#L25 assume !(~n <= 0); 51631#L26 call #t~ret0 := fact(~n - 1);< 51742#$Ultimate##0 ~n := #in~n; 51743#L25 assume !(~n <= 0); 51634#L26 call #t~ret0 := fact(~n - 1);< 51781#$Ultimate##0 ~n := #in~n; 51789#L25 assume ~n <= 0;#res := 1; 51788#factFINAL assume true; 51786#factEXIT >#70#return; 51785#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51784#factFINAL assume true; 51630#factEXIT >#70#return; 51626#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51621#factFINAL assume true; 51624#factEXIT >#78#return; 51834#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 51880#$Ultimate##0 ~n := #in~n; 51881#L25 assume ~n <= 0;#res := 1; 51876#factFINAL assume true; 51877#factEXIT >#80#return; 51240#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 51365#$Ultimate##0 ~n := #in~n; 52576#L25 assume !(~n <= 0); 51593#L26 call #t~ret0 := fact(~n - 1);< 51213#$Ultimate##0 ~n := #in~n; 51598#L25 assume !(~n <= 0); 51188#L26 call #t~ret0 := fact(~n - 1);< 51597#$Ultimate##0 ~n := #in~n; 51247#L25 assume ~n <= 0;#res := 1; 51201#factFINAL assume true; 51187#factEXIT >#70#return; 51189#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51613#factFINAL assume true; 51601#factEXIT >#70#return; 51602#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52572#factFINAL assume true; 52524#factEXIT >#82#return; 51345#L30-8 [2024-11-19 14:15:24,761 INFO L747 eck$LassoCheckResult]: Loop: 51345#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; 51230#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; 51231#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 51259#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 51234#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; 51183#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 51184#$Ultimate##0 ~n := #in~n; 51605#L25 assume !(~n <= 0); 51594#L26 call #t~ret0 := fact(~n - 1);< 51213#$Ultimate##0 ~n := #in~n; 51598#L25 assume !(~n <= 0); 51188#L26 call #t~ret0 := fact(~n - 1);< 51597#$Ultimate##0 ~n := #in~n; 51598#L25 assume !(~n <= 0); 51188#L26 call #t~ret0 := fact(~n - 1);< 51597#$Ultimate##0 ~n := #in~n; 51598#L25 assume !(~n <= 0); 51188#L26 call #t~ret0 := fact(~n - 1);< 51597#$Ultimate##0 ~n := #in~n; 51598#L25 assume !(~n <= 0); 51188#L26 call #t~ret0 := fact(~n - 1);< 51597#$Ultimate##0 ~n := #in~n; 51598#L25 assume !(~n <= 0); 51188#L26 call #t~ret0 := fact(~n - 1);< 51597#$Ultimate##0 ~n := #in~n; 51247#L25 assume ~n <= 0;#res := 1; 51201#factFINAL assume true; 51187#factEXIT >#70#return; 51189#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51613#factFINAL assume true; 51601#factEXIT >#70#return; 51603#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51614#factFINAL assume true; 51612#factEXIT >#70#return; 51611#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51610#factFINAL assume true; 51609#factEXIT >#70#return; 51608#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51607#factFINAL assume true; 51606#factEXIT >#70#return; 51596#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51604#factFINAL assume true; 51592#factEXIT >#70#return; 51591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51589#factFINAL assume true; 51587#factEXIT >#78#return; 51255#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 51254#$Ultimate##0 ~n := #in~n; 51256#L25 assume ~n <= 0;#res := 1; 51588#factFINAL assume true; 51572#factEXIT >#80#return; 51344#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 51184#$Ultimate##0 ~n := #in~n; 51605#L25 assume !(~n <= 0); 51594#L26 call #t~ret0 := fact(~n - 1);< 51213#$Ultimate##0 ~n := #in~n; 51598#L25 assume !(~n <= 0); 51188#L26 call #t~ret0 := fact(~n - 1);< 51597#$Ultimate##0 ~n := #in~n; 51598#L25 assume !(~n <= 0); 51188#L26 call #t~ret0 := fact(~n - 1);< 51597#$Ultimate##0 ~n := #in~n; 51598#L25 assume !(~n <= 0); 51188#L26 call #t~ret0 := fact(~n - 1);< 51597#$Ultimate##0 ~n := #in~n; 51598#L25 assume !(~n <= 0); 51188#L26 call #t~ret0 := fact(~n - 1);< 51597#$Ultimate##0 ~n := #in~n; 51598#L25 assume !(~n <= 0); 51188#L26 call #t~ret0 := fact(~n - 1);< 51597#$Ultimate##0 ~n := #in~n; 51247#L25 assume ~n <= 0;#res := 1; 51201#factFINAL assume true; 51187#factEXIT >#70#return; 51189#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51613#factFINAL assume true; 51601#factEXIT >#70#return; 51603#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51614#factFINAL assume true; 51612#factEXIT >#70#return; 51611#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51610#factFINAL assume true; 51609#factEXIT >#70#return; 51608#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51607#factFINAL assume true; 51606#factEXIT >#70#return; 51596#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51604#factFINAL assume true; 51592#factEXIT >#70#return; 51591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51589#factFINAL assume true; 51587#factEXIT >#82#return; 51345#L30-8 [2024-11-19 14:15:24,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1721354542, now seen corresponding path program 6 times [2024-11-19 14:15:24,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:24,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243033260] [2024-11-19 14:15:24,763 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:15:24,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:24,793 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-19 14:15:24,793 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:15:24,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061782938] [2024-11-19 14:15:24,794 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:15:24,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:24,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:24,799 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:24,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2024-11-19 14:15:24,902 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-19 14:15:24,902 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:24,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:24,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:24,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:24,940 INFO L85 PathProgramCache]: Analyzing trace with hash -490713092, now seen corresponding path program 6 times [2024-11-19 14:15:24,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:24,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923366132] [2024-11-19 14:15:24,941 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:15:24,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:24,962 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2024-11-19 14:15:24,962 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:15:24,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [88230298] [2024-11-19 14:15:24,963 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:15:24,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:24,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:24,965 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:24,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2024-11-19 14:15:25,099 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2024-11-19 14:15:25,099 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:25,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:25,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:25,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:25,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2090458025, now seen corresponding path program 7 times [2024-11-19 14:15:25,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:25,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973340379] [2024-11-19 14:15:25,188 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:15:25,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 282 proven. 194 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2024-11-19 14:15:25,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:25,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973340379] [2024-11-19 14:15:25,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973340379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:25,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10773200] [2024-11-19 14:15:25,497 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:15:25,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:25,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:25,500 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:25,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2024-11-19 14:15:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:25,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 14:15:25,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 1130 proven. 45 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2024-11-19 14:15:25,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 282 proven. 198 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2024-11-19 14:15:26,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10773200] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:26,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:26,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 15] total 18 [2024-11-19 14:15:26,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304389191] [2024-11-19 14:15:26,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:26,842 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:26,842 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:26,842 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:26,842 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:26,842 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:26,842 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,842 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:26,843 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:26,843 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2024-11-19 14:15:26,843 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:26,843 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:26,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,917 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:26,918 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:26,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:26,919 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-19 14:15:26,920 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-19 14:15:26,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:26,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:26,931 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:26,931 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-19 14:15:26,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2024-11-19 14:15:26,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:26,943 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-19 14:15:26,944 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-19 14:15:26,945 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:26,945 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:26,957 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:26,957 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-19 14:15:26,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:26,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:26,969 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-19 14:15:26,970 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-19 14:15:26,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:26,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:26,981 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:26,982 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-19 14:15:26,992 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-19 14:15:26,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:26,994 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-19 14:15:26,995 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-19 14:15:26,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:26,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:27,017 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-19 14:15:27,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:27,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:27,018 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-19 14:15:27,019 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-19 14:15:27,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:27,020 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:27,032 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:27,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2024-11-19 14:15:27,043 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:27,043 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:27,043 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:27,043 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:27,043 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:27,043 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:27,043 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:27,043 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:27,043 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2024-11-19 14:15:27,043 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:27,043 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:27,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:27,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:27,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:27,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:27,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:27,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:27,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:27,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:27,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:27,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:27,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:27,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:27,120 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:27,120 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:27,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:27,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:27,121 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-19 14:15:27,122 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-19 14:15:27,124 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-19 14:15:27,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:27,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:27,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:27,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:27,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:27,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:27,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:27,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:27,147 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-19 14:15:27,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:27,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:27,148 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-19 14:15:27,149 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-19 14:15:27,150 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-19 14:15:27,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:27,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:27,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:27,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:27,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:27,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:27,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:27,162 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:27,164 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:27,164 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:27,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:27,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:27,166 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-19 14:15:27,167 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-19 14:15:27,167 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:27,167 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:27,167 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:27,167 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-19 14:15:27,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2024-11-19 14:15:27,178 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:27,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:27,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 14:15:27,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:27,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-19 14:15:27,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:27,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:28,094 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-19 14:15:28,095 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-19 14:15:28,095 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1413 states and 1918 transitions. cyclomatic complexity: 532 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-19 14:15:28,457 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1413 states and 1918 transitions. cyclomatic complexity: 532. 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 3628 states and 4655 transitions. Complement of second has 97 states. [2024-11-19 14:15:28,458 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-19 14:15:28,458 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-19 14:15:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 91 transitions. [2024-11-19 14:15:28,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 91 transitions. Stem has 98 letters. Loop has 92 letters. [2024-11-19 14:15:28,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:28,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 91 transitions. Stem has 190 letters. Loop has 92 letters. [2024-11-19 14:15:28,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:28,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 91 transitions. Stem has 98 letters. Loop has 184 letters. [2024-11-19 14:15:28,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:28,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3628 states and 4655 transitions. [2024-11-19 14:15:28,480 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 113 [2024-11-19 14:15:28,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3628 states to 2423 states and 3148 transitions. [2024-11-19 14:15:28,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 431 [2024-11-19 14:15:28,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 436 [2024-11-19 14:15:28,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2423 states and 3148 transitions. [2024-11-19 14:15:28,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:28,502 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2423 states and 3148 transitions. [2024-11-19 14:15:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states and 3148 transitions. [2024-11-19 14:15:28,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 1643. [2024-11-19 14:15:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1077 states have (on average 1.0510677808727948) internal successors, (1132), 1076 states have internal predecessors, (1132), 288 states have call successors, (328), 172 states have call predecessors, (328), 278 states have return successors, (778), 394 states have call predecessors, (778), 288 states have call successors, (778) [2024-11-19 14:15:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2238 transitions. [2024-11-19 14:15:28,559 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1643 states and 2238 transitions. [2024-11-19 14:15:28,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:28,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 14:15:28,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-11-19 14:15:28,560 INFO L87 Difference]: Start difference. First operand 1643 states and 2238 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (22), 2 states have call predecessors, (22), 6 states have return successors, (24), 10 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-19 14:15:29,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:29,019 INFO L93 Difference]: Finished difference Result 2155 states and 3092 transitions. [2024-11-19 14:15:29,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2155 states and 3092 transitions. [2024-11-19 14:15:29,033 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 191 [2024-11-19 14:15:29,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2155 states to 2104 states and 3019 transitions. [2024-11-19 14:15:29,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 505 [2024-11-19 14:15:29,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 505 [2024-11-19 14:15:29,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2104 states and 3019 transitions. [2024-11-19 14:15:29,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:29,057 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2104 states and 3019 transitions. [2024-11-19 14:15:29,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states and 3019 transitions. [2024-11-19 14:15:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 1701. [2024-11-19 14:15:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1128 states have (on average 1.0549645390070923) internal successors, (1190), 1126 states have internal predecessors, (1190), 303 states have call successors, (336), 165 states have call predecessors, (336), 270 states have return successors, (856), 409 states have call predecessors, (856), 303 states have call successors, (856) [2024-11-19 14:15:29,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2382 transitions. [2024-11-19 14:15:29,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1701 states and 2382 transitions. [2024-11-19 14:15:29,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 14:15:29,113 INFO L425 stractBuchiCegarLoop]: Abstraction has 1701 states and 2382 transitions. [2024-11-19 14:15:29,113 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-19 14:15:29,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1701 states and 2382 transitions. [2024-11-19 14:15:29,118 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 151 [2024-11-19 14:15:29,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:29,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:29,120 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-19 14:15:29,120 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-19 14:15:29,120 INFO L745 eck$LassoCheckResult]: Stem: 61981#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 61927#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; 61928#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; 61951#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; 61938#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 61940#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 61995#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; 61925#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61926#$Ultimate##0 ~n := #in~n; 62953#L25 assume ~n <= 0;#res := 1; 62954#factFINAL assume true; 62038#factEXIT >#72#return; 61970#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 61971#$Ultimate##0 ~n := #in~n; 62943#L25 assume ~n <= 0;#res := 1; 62942#factFINAL assume true; 62939#factEXIT >#74#return; 61915#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 61916#$Ultimate##0 ~n := #in~n; 63017#L25 assume ~n <= 0;#res := 1; 63016#factFINAL assume true; 63015#factEXIT >#76#return; 63014#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; 61961#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; 61962#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 63068#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63066#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; 63033#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63041#$Ultimate##0 ~n := #in~n; 63077#L25 assume !(~n <= 0); 63072#L26 call #t~ret0 := fact(~n - 1);< 63074#$Ultimate##0 ~n := #in~n; 63080#L25 assume ~n <= 0;#res := 1; 63078#factFINAL assume true; 63075#factEXIT >#70#return; 63043#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63039#factFINAL assume true; 63032#factEXIT >#78#return; 63036#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63065#$Ultimate##0 ~n := #in~n; 63106#L25 assume ~n <= 0;#res := 1; 63105#factFINAL assume true; 63064#factEXIT >#80#return; 63034#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63040#$Ultimate##0 ~n := #in~n; 63088#L25 assume !(~n <= 0); 63046#L26 call #t~ret0 := fact(~n - 1);< 63047#$Ultimate##0 ~n := #in~n; 63086#L25 assume ~n <= 0;#res := 1; 63195#factFINAL assume true; 63045#factEXIT >#70#return; 63043#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63039#factFINAL assume true; 63032#factEXIT >#82#return; 63035#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; 62966#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; 62961#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 61990#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 61991#L42-4 havoc main_~k~0#1; 61949#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 61950#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 62156#L42-3 [2024-11-19 14:15:29,121 INFO L747 eck$LassoCheckResult]: Loop: 62156#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 62155#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; 62141#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 62144#$Ultimate##0 ~n := #in~n; 62252#L25 assume !(~n <= 0); 62079#L26 call #t~ret0 := fact(~n - 1);< 62201#$Ultimate##0 ~n := #in~n; 62206#L25 assume !(~n <= 0); 62197#L26 call #t~ret0 := fact(~n - 1);< 62203#$Ultimate##0 ~n := #in~n; 62208#L25 assume ~n <= 0;#res := 1; 62209#factFINAL assume true; 62207#factEXIT >#70#return; 62205#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62202#factFINAL assume true; 62196#factEXIT >#70#return; 62199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62260#factFINAL assume true; 62231#factEXIT >#72#return; 62139#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 62144#$Ultimate##0 ~n := #in~n; 62252#L25 assume ~n <= 0;#res := 1; 62149#factFINAL assume true; 62138#factEXIT >#74#return; 62143#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 62230#$Ultimate##0 ~n := #in~n; 62253#L25 assume !(~n <= 0); 62079#L26 call #t~ret0 := fact(~n - 1);< 62201#$Ultimate##0 ~n := #in~n; 62206#L25 assume !(~n <= 0); 62197#L26 call #t~ret0 := fact(~n - 1);< 62203#$Ultimate##0 ~n := #in~n; 62208#L25 assume ~n <= 0;#res := 1; 62209#factFINAL assume true; 62207#factEXIT >#70#return; 62205#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62202#factFINAL assume true; 62196#factEXIT >#70#return; 62199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62260#factFINAL assume true; 62231#factEXIT >#76#return; 62186#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; 62229#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; 62227#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 62225#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 62223#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; 62012#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61924#$Ultimate##0 ~n := #in~n; 62232#L25 assume !(~n <= 0); 62077#L26 call #t~ret0 := fact(~n - 1);< 62201#$Ultimate##0 ~n := #in~n; 62103#L25 assume ~n <= 0;#res := 1; 62099#factFINAL assume true; 62075#factEXIT >#70#return; 62082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62222#factFINAL assume true; 62216#factEXIT >#72#return; 62101#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 62214#$Ultimate##0 ~n := #in~n; 62212#L25 assume !(~n <= 0); 62078#L26 call #t~ret0 := fact(~n - 1);< 62085#$Ultimate##0 ~n := #in~n; 62103#L25 assume ~n <= 0;#res := 1; 62099#factFINAL assume true; 62075#factEXIT >#70#return; 62082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62222#factFINAL assume true; 62216#factEXIT >#74#return; 61913#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 61914#$Ultimate##0 ~n := #in~n; 62292#L25 assume ~n <= 0;#res := 1; 62213#factFINAL assume true; 62286#factEXIT >#76#return; 62288#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; 63598#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; 61979#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 61967#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 61955#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; 61956#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61924#$Ultimate##0 ~n := #in~n; 62232#L25 assume !(~n <= 0); 62077#L26 call #t~ret0 := fact(~n - 1);< 62201#$Ultimate##0 ~n := #in~n; 62206#L25 assume !(~n <= 0); 62197#L26 call #t~ret0 := fact(~n - 1);< 62203#$Ultimate##0 ~n := #in~n; 62208#L25 assume ~n <= 0;#res := 1; 62209#factFINAL assume true; 62207#factEXIT >#70#return; 62205#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62202#factFINAL assume true; 62196#factEXIT >#70#return; 62198#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63555#factFINAL assume true; 63532#factEXIT >#78#return; 62100#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 62214#$Ultimate##0 ~n := #in~n; 62212#L25 assume !(~n <= 0); 62078#L26 call #t~ret0 := fact(~n - 1);< 62085#$Ultimate##0 ~n := #in~n; 62103#L25 assume ~n <= 0;#res := 1; 62099#factFINAL assume true; 62075#factEXIT >#70#return; 62082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62222#factFINAL assume true; 62216#factEXIT >#80#return; 62026#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 61983#$Ultimate##0 ~n := #in~n; 62228#L25 assume !(~n <= 0); 62077#L26 call #t~ret0 := fact(~n - 1);< 62201#$Ultimate##0 ~n := #in~n; 62103#L25 assume ~n <= 0;#res := 1; 62099#factFINAL assume true; 62075#factEXIT >#70#return; 62082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62222#factFINAL assume true; 62216#factEXIT >#82#return; 62220#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; 63587#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; 63538#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 63536#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 61985#L42-4 havoc main_~k~0#1; 61947#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 61948#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 62156#L42-3 [2024-11-19 14:15:29,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:29,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 1 times [2024-11-19 14:15:29,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:29,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966913311] [2024-11-19 14:15:29,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:29,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 14:15:29,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [987157216] [2024-11-19 14:15:29,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:29,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:29,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:29,134 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:29,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Waiting until timeout for monitored process [2024-11-19 14:15:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:29,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:29,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:29,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:29,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1926235696, now seen corresponding path program 6 times [2024-11-19 14:15:29,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:29,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487850834] [2024-11-19 14:15:29,252 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:15:29,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:29,277 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2024-11-19 14:15:29,278 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 15 proven. 188 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2024-11-19 14:15:29,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:29,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487850834] [2024-11-19 14:15:29,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487850834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:29,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530598173] [2024-11-19 14:15:29,551 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:15:29,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:29,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:29,553 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:29,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Waiting until timeout for monitored process [2024-11-19 14:15:29,692 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2024-11-19 14:15:29,692 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:29,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 14:15:29,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 77 proven. 179 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-11-19 14:15:29,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 77 proven. 181 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2024-11-19 14:15:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530598173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:30,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:30,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 27 [2024-11-19 14:15:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925830484] [2024-11-19 14:15:30,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:30,208 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:15:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:30,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 14:15:30,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2024-11-19 14:15:30,211 INFO L87 Difference]: Start difference. First operand 1701 states and 2382 transitions. cyclomatic complexity: 712 Second operand has 27 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 24 states have internal predecessors, (60), 17 states have call successors, (27), 1 states have call predecessors, (27), 4 states have return successors, (27), 14 states have call predecessors, (27), 17 states have call successors, (27) [2024-11-19 14:15:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:31,382 INFO L93 Difference]: Finished difference Result 2103 states and 3016 transitions. [2024-11-19 14:15:31,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2103 states and 3016 transitions. [2024-11-19 14:15:31,392 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 242 [2024-11-19 14:15:31,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2103 states to 1875 states and 2740 transitions. [2024-11-19 14:15:31,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 502 [2024-11-19 14:15:31,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 502 [2024-11-19 14:15:31,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1875 states and 2740 transitions. [2024-11-19 14:15:31,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:31,412 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1875 states and 2740 transitions. [2024-11-19 14:15:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states and 2740 transitions. [2024-11-19 14:15:31,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1651. [2024-11-19 14:15:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1092 states have (on average 1.0476190476190477) internal successors, (1144), 1088 states have internal predecessors, (1144), 297 states have call successors, (330), 159 states have call predecessors, (330), 262 states have return successors, (834), 403 states have call predecessors, (834), 297 states have call successors, (834) [2024-11-19 14:15:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2308 transitions. [2024-11-19 14:15:31,463 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1651 states and 2308 transitions. [2024-11-19 14:15:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-19 14:15:31,464 INFO L425 stractBuchiCegarLoop]: Abstraction has 1651 states and 2308 transitions. [2024-11-19 14:15:31,465 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-19 14:15:31,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1651 states and 2308 transitions. [2024-11-19 14:15:31,470 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 145 [2024-11-19 14:15:31,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:31,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:31,472 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-19 14:15:31,472 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-19 14:15:31,472 INFO L745 eck$LassoCheckResult]: Stem: 66666#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 66601#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; 66602#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; 66624#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; 66612#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 66614#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 67549#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; 66599#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 66600#$Ultimate##0 ~n := #in~n; 67553#L25 assume ~n <= 0;#res := 1; 67552#factFINAL assume true; 67464#factEXIT >#72#return; 66657#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 66658#$Ultimate##0 ~n := #in~n; 67556#L25 assume ~n <= 0;#res := 1; 67555#factFINAL assume true; 67554#factEXIT >#74#return; 66588#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 66589#$Ultimate##0 ~n := #in~n; 67649#L25 assume ~n <= 0;#res := 1; 67648#factFINAL assume true; 67647#factEXIT >#76#return; 67646#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; 67645#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; 67644#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 67642#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 67640#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; 67630#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 67632#$Ultimate##0 ~n := #in~n; 67650#L25 assume !(~n <= 0); 67638#L26 call #t~ret0 := fact(~n - 1);< 67639#$Ultimate##0 ~n := #in~n; 67652#L25 assume ~n <= 0;#res := 1; 67651#factFINAL assume true; 67637#factEXIT >#70#return; 67636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67633#factFINAL assume true; 67628#factEXIT >#78#return; 67631#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 67635#$Ultimate##0 ~n := #in~n; 67643#L25 assume ~n <= 0;#res := 1; 67641#factFINAL assume true; 67634#factEXIT >#80#return; 67629#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 67632#$Ultimate##0 ~n := #in~n; 67650#L25 assume !(~n <= 0); 67638#L26 call #t~ret0 := fact(~n - 1);< 67639#$Ultimate##0 ~n := #in~n; 67652#L25 assume ~n <= 0;#res := 1; 67651#factFINAL assume true; 67637#factEXIT >#70#return; 67636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67633#factFINAL assume true; 67628#factEXIT >#82#return; 67626#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; 66606#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; 67380#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 66674#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 66675#L42-4 havoc main_~k~0#1; 66622#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 66623#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 66780#L42-3 [2024-11-19 14:15:31,473 INFO L747 eck$LassoCheckResult]: Loop: 66780#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 66778#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; 66764#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 66772#$Ultimate##0 ~n := #in~n; 66783#L25 assume !(~n <= 0); 66697#L26 call #t~ret0 := fact(~n - 1);< 66723#$Ultimate##0 ~n := #in~n; 66724#L25 assume ~n <= 0;#res := 1; 66731#factFINAL assume true; 66726#factEXIT >#70#return; 66729#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66771#factFINAL assume true; 66760#factEXIT >#72#return; 66766#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 66774#$Ultimate##0 ~n := #in~n; 66781#L25 assume ~n <= 0;#res := 1; 66779#factFINAL assume true; 66773#factEXIT >#74#return; 66762#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 66767#$Ultimate##0 ~n := #in~n; 66784#L25 assume !(~n <= 0); 66697#L26 call #t~ret0 := fact(~n - 1);< 66723#$Ultimate##0 ~n := #in~n; 66724#L25 assume ~n <= 0;#res := 1; 66731#factFINAL assume true; 66726#factEXIT >#70#return; 66729#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66771#factFINAL assume true; 66760#factEXIT >#76#return; 66758#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; 66756#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; 66754#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 66752#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 66744#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; 66566#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 66738#$Ultimate##0 ~n := #in~n; 66735#L25 assume !(~n <= 0); 66705#L26 call #t~ret0 := fact(~n - 1);< 66706#$Ultimate##0 ~n := #in~n; 66724#L25 assume ~n <= 0;#res := 1; 66731#factFINAL assume true; 66726#factEXIT >#70#return; 66727#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66789#factFINAL assume true; 66745#factEXIT >#72#return; 66559#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 66738#$Ultimate##0 ~n := #in~n; 66735#L25 assume !(~n <= 0); 66705#L26 call #t~ret0 := fact(~n - 1);< 66706#$Ultimate##0 ~n := #in~n; 66724#L25 assume ~n <= 0;#res := 1; 66731#factFINAL assume true; 66726#factEXIT >#70#return; 66727#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66789#factFINAL assume true; 66745#factEXIT >#74#return; 66564#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 66587#$Ultimate##0 ~n := #in~n; 66932#L25 assume ~n <= 0;#res := 1; 66736#factFINAL assume true; 66540#factEXIT >#76#return; 66581#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; 68137#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; 68135#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 68133#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 68132#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; 66560#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 66694#$Ultimate##0 ~n := #in~n; 66708#L25 assume !(~n <= 0); 66701#L26 call #t~ret0 := fact(~n - 1);< 66723#$Ultimate##0 ~n := #in~n; 66721#L25 assume !(~n <= 0); 66699#L26 call #t~ret0 := fact(~n - 1);< 66720#$Ultimate##0 ~n := #in~n; 66722#L25 assume ~n <= 0;#res := 1; 66896#factFINAL assume true; 66895#factEXIT >#70#return; 66894#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66893#factFINAL assume true; 66891#factEXIT >#70#return; 66695#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66692#factFINAL assume true; 66693#factEXIT >#78#return; 66549#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 66738#$Ultimate##0 ~n := #in~n; 66735#L25 assume !(~n <= 0); 66705#L26 call #t~ret0 := fact(~n - 1);< 66706#$Ultimate##0 ~n := #in~n; 66724#L25 assume ~n <= 0;#res := 1; 66731#factFINAL assume true; 66726#factEXIT >#70#return; 66727#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66789#factFINAL assume true; 66745#factEXIT >#80#return; 66681#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 66691#$Ultimate##0 ~n := #in~n; 66707#L25 assume !(~n <= 0); 66701#L26 call #t~ret0 := fact(~n - 1);< 66723#$Ultimate##0 ~n := #in~n; 66724#L25 assume ~n <= 0;#res := 1; 66731#factFINAL assume true; 66726#factEXIT >#70#return; 66727#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66789#factFINAL assume true; 66745#factEXIT >#82#return; 66746#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; 68139#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; 68138#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 68136#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 66669#L42-4 havoc main_~k~0#1; 66620#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 66621#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 66780#L42-3 [2024-11-19 14:15:31,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 2 times [2024-11-19 14:15:31,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:31,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535167428] [2024-11-19 14:15:31,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:31,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:31,483 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:31,484 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:15:31,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324892689] [2024-11-19 14:15:31,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:31,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:31,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:31,487 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:31,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2024-11-19 14:15:31,580 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:31,580 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:31,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:31,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:31,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:31,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1812156592, now seen corresponding path program 7 times [2024-11-19 14:15:31,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:31,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662454491] [2024-11-19 14:15:31,649 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:15:31,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 14:15:31,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397332057] [2024-11-19 14:15:31,683 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:15:31,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:31,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:31,686 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-19 14:15:31,687 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-19 14:15:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:31,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:31,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:31,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:31,897 INFO L85 PathProgramCache]: Analyzing trace with hash 696833001, now seen corresponding path program 3 times [2024-11-19 14:15:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896689598] [2024-11-19 14:15:31,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:31,985 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2024-11-19 14:15:31,985 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 99 proven. 121 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2024-11-19 14:15:32,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:32,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896689598] [2024-11-19 14:15:32,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896689598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:32,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899652177] [2024-11-19 14:15:32,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:32,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:32,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:32,285 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-19 14:15:32,287 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-19 14:15:32,468 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2024-11-19 14:15:32,469 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:32,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:15:32,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 1307 trivial. 0 not checked. [2024-11-19 14:15:32,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 3 proven. 46 refuted. 0 times theorem prover too weak. 1307 trivial. 0 not checked. [2024-11-19 14:15:32,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899652177] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:32,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:32,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 24 [2024-11-19 14:15:32,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947860424] [2024-11-19 14:15:32,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:33,637 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:33,637 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:33,637 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:33,637 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:33,637 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:33,637 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:33,637 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:33,638 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:33,638 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration21_Loop [2024-11-19 14:15:33,638 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:33,638 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:33,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,702 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:33,702 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:33,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:33,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:33,704 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/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-19 14:15:33,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2024-11-19 14:15:33,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:33,705 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:33,717 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:33,717 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-19 14:15:33,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:33,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:33,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:33,729 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-19 14:15:33,730 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-19 14:15:33,730 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:33,730 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:33,742 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:33,742 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-19 14:15:33,753 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-19 14:15:33,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:33,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:33,754 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-19 14:15:33,755 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-19 14:15:33,755 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:33,756 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:33,766 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:33,766 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-19 14:15:33,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2024-11-19 14:15:33,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:33,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:33,778 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-19 14:15:33,779 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-19 14:15:33,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:33,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:33,791 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:33,791 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-19 14:15:33,801 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-19 14:15:33,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:33,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:33,803 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-19 14:15:33,804 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-19 14:15:33,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:33,804 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:33,815 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:33,815 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-19 14:15:33,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2024-11-19 14:15:33,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:33,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:33,827 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-19 14:15:33,827 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-19 14:15:33,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:33,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:33,839 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:33,839 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-19 14:15:33,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2024-11-19 14:15:33,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:33,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:33,852 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-19 14:15:33,854 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-19 14:15:33,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:33,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:33,866 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:33,866 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-19 14:15:33,877 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-19 14:15:33,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:33,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:33,878 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-19 14:15:33,880 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-19 14:15:33,880 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:33,880 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:33,904 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-19 14:15:33,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:33,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:33,905 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-19 14:15:33,906 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-19 14:15:33,907 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:33,907 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:33,919 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:33,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2024-11-19 14:15:33,929 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:33,929 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:33,930 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:33,930 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:33,930 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:33,930 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:33,930 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:33,930 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:33,930 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration21_Loop [2024-11-19 14:15:33,930 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:33,930 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:33,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:33,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:34,004 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:34,004 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:34,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:34,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:34,006 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-19 14:15:34,007 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-19 14:15:34,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-19 14:15:34,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:34,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:34,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:34,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:34,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:34,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:34,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:34,020 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:34,030 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-19 14:15:34,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:34,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:34,032 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-19 14:15:34,033 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-19 14:15:34,033 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-19 14:15:34,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:34,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:34,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:34,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:34,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:34,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:34,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:34,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:34,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2024-11-19 14:15:34,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:34,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:34,057 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-19 14:15:34,058 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-19 14:15:34,058 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-19 14:15:34,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:34,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:34,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:34,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:34,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:34,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:34,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:34,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:34,081 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-19 14:15:34,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:34,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:34,083 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-19 14:15:34,083 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-19 14:15:34,084 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-19 14:15:34,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:34,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:34,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:34,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:34,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:34,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:34,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:34,096 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:34,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2024-11-19 14:15:34,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:34,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:34,108 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-19 14:15:34,109 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-19 14:15:34,109 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-19 14:15:34,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:34,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:34,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:34,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:34,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:34,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:34,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:34,121 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:34,132 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-19 14:15:34,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:34,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:34,134 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-19 14:15:34,135 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-19 14:15:34,135 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-19 14:15:34,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:34,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:34,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:34,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:34,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:34,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:34,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:34,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:34,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2024-11-19 14:15:34,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:34,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:34,165 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-19 14:15:34,165 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-19 14:15:34,166 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-19 14:15:34,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:34,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:34,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:34,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:34,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:34,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:34,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:34,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:34,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2024-11-19 14:15:34,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:34,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:34,190 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-19 14:15:34,191 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-19 14:15:34,192 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-19 14:15:34,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:34,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:34,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:34,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:34,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:34,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:34,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:34,204 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:34,206 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:34,206 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:34,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:34,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:34,209 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:34,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2024-11-19 14:15:34,241 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:34,241 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:34,242 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:34,242 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-19 14:15:34,252 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-19 14:15:34,253 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:34,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:34,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 14:15:34,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:34,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 14:15:34,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:34,896 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-19 14:15:34,897 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-19 14:15:34,897 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1651 states and 2308 transitions. cyclomatic complexity: 686 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-19 14:15:35,159 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1651 states and 2308 transitions. cyclomatic complexity: 686. 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 3478 states and 4853 transitions. Complement of second has 40 states. [2024-11-19 14:15:35,159 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-19 14:15:35,160 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-19 14:15:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2024-11-19 14:15:35,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 80 transitions. Stem has 61 letters. Loop has 112 letters. [2024-11-19 14:15:35,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:35,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 80 transitions. Stem has 173 letters. Loop has 112 letters. [2024-11-19 14:15:35,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:35,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 80 transitions. Stem has 61 letters. Loop has 224 letters. [2024-11-19 14:15:35,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:35,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3478 states and 4853 transitions. [2024-11-19 14:15:35,180 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 129 [2024-11-19 14:15:35,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3478 states to 1967 states and 2815 transitions. [2024-11-19 14:15:35,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 431 [2024-11-19 14:15:35,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 433 [2024-11-19 14:15:35,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1967 states and 2815 transitions. [2024-11-19 14:15:35,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:35,199 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1967 states and 2815 transitions. [2024-11-19 14:15:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states and 2815 transitions. [2024-11-19 14:15:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1963. [2024-11-19 14:15:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1963 states, 1293 states have (on average 1.0564578499613302) internal successors, (1366), 1291 states have internal predecessors, (1366), 374 states have call successors, (407), 181 states have call predecessors, (407), 296 states have return successors, (1038), 490 states have call predecessors, (1038), 374 states have call successors, (1038) [2024-11-19 14:15:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2811 transitions. [2024-11-19 14:15:35,261 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1963 states and 2811 transitions. [2024-11-19 14:15:35,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:35,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 14:15:35,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-11-19 14:15:35,262 INFO L87 Difference]: Start difference. First operand 1963 states and 2811 transitions. Second operand has 25 states, 22 states have (on average 4.136363636363637) internal successors, (91), 24 states have internal predecessors, (91), 13 states have call successors, (38), 1 states have call predecessors, (38), 3 states have return successors, (38), 12 states have call predecessors, (38), 13 states have call successors, (38) [2024-11-19 14:15:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:36,267 INFO L93 Difference]: Finished difference Result 2674 states and 4187 transitions. [2024-11-19 14:15:36,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2674 states and 4187 transitions. [2024-11-19 14:15:36,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:36,323 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 202 [2024-11-19 14:15:36,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2674 states to 2187 states and 3282 transitions. [2024-11-19 14:15:36,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 589 [2024-11-19 14:15:36,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 601 [2024-11-19 14:15:36,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2187 states and 3282 transitions. [2024-11-19 14:15:36,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:36,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2187 states and 3282 transitions. [2024-11-19 14:15:36,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states and 3282 transitions. [2024-11-19 14:15:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 1984. [2024-11-19 14:15:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1306 states have (on average 1.0520673813169985) internal successors, (1374), 1305 states have internal predecessors, (1374), 382 states have call successors, (415), 181 states have call predecessors, (415), 296 states have return successors, (1063), 497 states have call predecessors, (1063), 382 states have call successors, (1063) [2024-11-19 14:15:36,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2852 transitions. [2024-11-19 14:15:36,402 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1984 states and 2852 transitions. [2024-11-19 14:15:36,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-19 14:15:36,404 INFO L425 stractBuchiCegarLoop]: Abstraction has 1984 states and 2852 transitions. [2024-11-19 14:15:36,404 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-19 14:15:36,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1984 states and 2852 transitions. [2024-11-19 14:15:36,413 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 139 [2024-11-19 14:15:36,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:36,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:36,415 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-19 14:15:36,415 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 27, 27, 27, 27, 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-19 14:15:36,415 INFO L745 eck$LassoCheckResult]: Stem: 78077#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 78025#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; 78026#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; 78047#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; 78078#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 78500#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 78499#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; 78016#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 78017#$Ultimate##0 ~n := #in~n; 78496#L25 assume ~n <= 0;#res := 1; 78494#factFINAL assume true; 78493#factEXIT >#72#return; 78066#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 78067#$Ultimate##0 ~n := #in~n; 78599#L25 assume ~n <= 0;#res := 1; 78598#factFINAL assume true; 78596#factEXIT >#74#return; 78006#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 78007#$Ultimate##0 ~n := #in~n; 78624#L25 assume ~n <= 0;#res := 1; 78623#factFINAL assume true; 78622#factEXIT >#76#return; 78042#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; 78043#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; 78056#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 78701#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 78699#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; 78684#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 78687#$Ultimate##0 ~n := #in~n; 78705#L25 assume !(~n <= 0); 78703#L26 call #t~ret0 := fact(~n - 1);< 78704#$Ultimate##0 ~n := #in~n; 78708#L25 assume ~n <= 0;#res := 1; 78706#factFINAL assume true; 78702#factEXIT >#70#return; 78700#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78698#factFINAL assume true; 78683#factEXIT >#78#return; 78686#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 78690#$Ultimate##0 ~n := #in~n; 78697#L25 assume ~n <= 0;#res := 1; 78696#factFINAL assume true; 78689#factEXIT >#80#return; 78685#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 78687#$Ultimate##0 ~n := #in~n; 78705#L25 assume !(~n <= 0); 78703#L26 call #t~ret0 := fact(~n - 1);< 78704#$Ultimate##0 ~n := #in~n; 78708#L25 assume ~n <= 0;#res := 1; 78706#factFINAL assume true; 78702#factEXIT >#70#return; 78700#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78698#factFINAL assume true; 78683#factEXIT >#82#return; 78681#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; 78680#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; 78678#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 78676#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 78675#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; 78650#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 78652#$Ultimate##0 ~n := #in~n; 78718#L25 assume !(~n <= 0); 78711#L26 call #t~ret0 := fact(~n - 1);< 78717#$Ultimate##0 ~n := #in~n; 78734#L25 assume !(~n <= 0); 78710#L26 call #t~ret0 := fact(~n - 1);< 78731#$Ultimate##0 ~n := #in~n; 78871#L25 assume ~n <= 0;#res := 1; 78763#factFINAL assume true; 78730#factEXIT >#70#return; 78728#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78719#factFINAL assume true; 78709#factEXIT >#70#return; 78707#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78670#factFINAL assume true; 78646#factEXIT >#78#return; 78635#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 78638#$Ultimate##0 ~n := #in~n; 78669#L25 assume ~n <= 0;#res := 1; 78642#factFINAL assume true; 78634#factEXIT >#80#return; 78560#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 78561#$Ultimate##0 ~n := #in~n; 78735#L25 assume !(~n <= 0); 78663#L26 call #t~ret0 := fact(~n - 1);< 78668#$Ultimate##0 ~n := #in~n; 78764#L25 assume !(~n <= 0); 78661#L26 call #t~ret0 := fact(~n - 1);< 78733#$Ultimate##0 ~n := #in~n; 78737#L25 assume ~n <= 0;#res := 1; 78736#factFINAL assume true; 78732#factEXIT >#70#return; 78729#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78727#factFINAL assume true; 78660#factEXIT >#70#return; 78641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78640#factFINAL assume true; 78632#factEXIT >#82#return; 78630#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; 78546#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; 78547#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 78250#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 78249#L42-4 havoc main_~k~0#1; 78248#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 78243#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 78244#L42-3 [2024-11-19 14:15:36,416 INFO L747 eck$LassoCheckResult]: Loop: 78244#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 79290#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; 79283#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 79288#$Ultimate##0 ~n := #in~n; 79291#L25 assume !(~n <= 0); 79201#L26 call #t~ret0 := fact(~n - 1);< 79225#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79224#L25 assume ~n <= 0;#res := 1; 79364#factFINAL assume true; 79361#factEXIT >#70#return; 79359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79356#factFINAL assume true; 79351#factEXIT >#70#return; 79208#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79408#factFINAL assume true; 79407#factEXIT >#72#return; 79284#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 79288#$Ultimate##0 ~n := #in~n; 79291#L25 assume ~n <= 0;#res := 1; 79289#factFINAL assume true; 79281#factEXIT >#74#return; 79287#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 79307#$Ultimate##0 ~n := #in~n; 79316#L25 assume !(~n <= 0); 79201#L26 call #t~ret0 := fact(~n - 1);< 79225#$Ultimate##0 ~n := #in~n; 79226#L25 assume ~n <= 0;#res := 1; 79317#factFINAL assume true; 79311#factEXIT >#70#return; 79309#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79306#factFINAL assume true; 79302#factEXIT >#76#return; 79304#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; 79983#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; 79982#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 79981#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 79980#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; 79168#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 79196#$Ultimate##0 ~n := #in~n; 79214#L25 assume !(~n <= 0); 79200#L26 call #t~ret0 := fact(~n - 1);< 79225#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79224#L25 assume ~n <= 0;#res := 1; 79364#factFINAL assume true; 79361#factEXIT >#70#return; 79359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79356#factFINAL assume true; 79351#factEXIT >#70#return; 79352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79380#factFINAL assume true; 79386#factEXIT >#70#return; 79206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79215#factFINAL assume true; 79198#factEXIT >#70#return; 79207#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79972#factFINAL assume true; 79409#factEXIT >#72#return; 79164#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 79196#$Ultimate##0 ~n := #in~n; 79214#L25 assume !(~n <= 0); 79200#L26 call #t~ret0 := fact(~n - 1);< 79225#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79224#L25 assume ~n <= 0;#res := 1; 79364#factFINAL assume true; 79361#factEXIT >#70#return; 79359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79356#factFINAL assume true; 79351#factEXIT >#70#return; 79352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79380#factFINAL assume true; 79386#factEXIT >#70#return; 79206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79215#factFINAL assume true; 79198#factEXIT >#70#return; 79207#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79972#factFINAL assume true; 79409#factEXIT >#74#return; 79156#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 79196#$Ultimate##0 ~n := #in~n; 79214#L25 assume ~n <= 0;#res := 1; 79229#factFINAL assume true; 79432#factEXIT >#76#return; 79191#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; 79979#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; 79978#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 79977#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 79976#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; 79174#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 79196#$Ultimate##0 ~n := #in~n; 79214#L25 assume !(~n <= 0); 79200#L26 call #t~ret0 := fact(~n - 1);< 79225#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79224#L25 assume ~n <= 0;#res := 1; 79364#factFINAL assume true; 79361#factEXIT >#70#return; 79359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79356#factFINAL assume true; 79351#factEXIT >#70#return; 79352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79380#factFINAL assume true; 79386#factEXIT >#70#return; 79206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79215#factFINAL assume true; 79198#factEXIT >#70#return; 79207#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79972#factFINAL assume true; 79409#factEXIT >#72#return; 79159#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 79196#$Ultimate##0 ~n := #in~n; 79214#L25 assume !(~n <= 0); 79200#L26 call #t~ret0 := fact(~n - 1);< 79225#$Ultimate##0 ~n := #in~n; 79226#L25 assume ~n <= 0;#res := 1; 79317#factFINAL assume true; 79311#factEXIT >#70#return; 79313#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79411#factFINAL assume true; 79146#factEXIT >#74#return; 79181#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 79196#$Ultimate##0 ~n := #in~n; 79214#L25 assume ~n <= 0;#res := 1; 79229#factFINAL assume true; 79432#factEXIT >#76#return; 79428#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; 79429#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; 79975#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 79974#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 79973#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; 79177#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 79196#$Ultimate##0 ~n := #in~n; 79214#L25 assume !(~n <= 0); 79200#L26 call #t~ret0 := fact(~n - 1);< 79225#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79224#L25 assume ~n <= 0;#res := 1; 79364#factFINAL assume true; 79361#factEXIT >#70#return; 79359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79356#factFINAL assume true; 79351#factEXIT >#70#return; 79352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79380#factFINAL assume true; 79386#factEXIT >#70#return; 79197#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79194#factFINAL assume true; 79195#factEXIT >#78#return; 79167#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 79230#$Ultimate##0 ~n := #in~n; 79228#L25 assume !(~n <= 0); 79211#L26 call #t~ret0 := fact(~n - 1);< 79212#$Ultimate##0 ~n := #in~n; 79226#L25 assume ~n <= 0;#res := 1; 79317#factFINAL assume true; 79311#factEXIT >#70#return; 79313#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79411#factFINAL assume true; 79146#factEXIT >#80#return; 79160#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 79193#$Ultimate##0 ~n := #in~n; 79213#L25 assume !(~n <= 0); 79200#L26 call #t~ret0 := fact(~n - 1);< 79225#$Ultimate##0 ~n := #in~n; 79226#L25 assume ~n <= 0;#res := 1; 79317#factFINAL assume true; 79311#factEXIT >#70#return; 79313#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79411#factFINAL assume true; 79146#factEXIT >#82#return; 79192#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; 79427#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; 78616#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 78617#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 79525#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; 79166#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 79193#$Ultimate##0 ~n := #in~n; 79213#L25 assume !(~n <= 0); 79200#L26 call #t~ret0 := fact(~n - 1);< 79225#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79224#L25 assume ~n <= 0;#res := 1; 79364#factFINAL assume true; 79361#factEXIT >#70#return; 79359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79356#factFINAL assume true; 79351#factEXIT >#70#return; 79352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79380#factFINAL assume true; 79386#factEXIT >#70#return; 79206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79215#factFINAL assume true; 79198#factEXIT >#70#return; 79207#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79972#factFINAL assume true; 79409#factEXIT >#78#return; 79173#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 79230#$Ultimate##0 ~n := #in~n; 79228#L25 assume ~n <= 0;#res := 1; 79229#factFINAL assume true; 79432#factEXIT >#80#return; 79182#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 79193#$Ultimate##0 ~n := #in~n; 79213#L25 assume !(~n <= 0); 79200#L26 call #t~ret0 := fact(~n - 1);< 79225#$Ultimate##0 ~n := #in~n; 79223#L25 assume !(~n <= 0); 79199#L26 call #t~ret0 := fact(~n - 1);< 79222#$Ultimate##0 ~n := #in~n; 79224#L25 assume ~n <= 0;#res := 1; 79364#factFINAL assume true; 79361#factEXIT >#70#return; 79359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79356#factFINAL assume true; 79351#factEXIT >#70#return; 79353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79956#factFINAL assume true; 79934#factEXIT >#82#return; 79410#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; 79426#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; 79421#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 79295#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 79294#L42-4 havoc main_~k~0#1; 79293#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 79292#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 78244#L42-3 [2024-11-19 14:15:36,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash 157168703, now seen corresponding path program 4 times [2024-11-19 14:15:36,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:36,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731777162] [2024-11-19 14:15:36,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:36,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:36,434 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:36,434 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:15:36,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [820173555] [2024-11-19 14:15:36,435 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:36,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:36,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:36,438 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-19 14:15:36,439 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-19 14:15:36,638 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:36,639 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:36,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:36,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:36,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:36,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1857235550, now seen corresponding path program 8 times [2024-11-19 14:15:36,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:36,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895890290] [2024-11-19 14:15:36,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:36,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:36,715 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:36,716 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4201 backedges. 68 proven. 269 refuted. 0 times theorem prover too weak. 3864 trivial. 0 not checked. [2024-11-19 14:15:36,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:36,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895890290] [2024-11-19 14:15:36,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895890290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:36,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858159947] [2024-11-19 14:15:36,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:36,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:36,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:36,935 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-19 14:15:36,936 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-19 14:15:37,085 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:37,085 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:37,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 14:15:37,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4201 backedges. 1039 proven. 29 refuted. 0 times theorem prover too weak. 3133 trivial. 0 not checked. [2024-11-19 14:15:37,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4201 backedges. 31 proven. 716 refuted. 0 times theorem prover too weak. 3454 trivial. 0 not checked. [2024-11-19 14:15:37,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858159947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:37,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:37,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 19 [2024-11-19 14:15:37,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916885882] [2024-11-19 14:15:37,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:37,696 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:15:37,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:37,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 14:15:37,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2024-11-19 14:15:37,696 INFO L87 Difference]: Start difference. First operand 1984 states and 2852 transitions. cyclomatic complexity: 901 Second operand has 19 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 12 states have call successors, (29), 2 states have call predecessors, (29), 6 states have return successors, (30), 11 states have call predecessors, (30), 12 states have call successors, (30) [2024-11-19 14:15:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:38,358 INFO L93 Difference]: Finished difference Result 2217 states and 3241 transitions. [2024-11-19 14:15:38,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2217 states and 3241 transitions. [2024-11-19 14:15:38,371 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 157 [2024-11-19 14:15:38,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2217 states to 2141 states and 3053 transitions. [2024-11-19 14:15:38,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 494 [2024-11-19 14:15:38,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 494 [2024-11-19 14:15:38,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2141 states and 3053 transitions. [2024-11-19 14:15:38,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:38,390 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2141 states and 3053 transitions. [2024-11-19 14:15:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states and 3053 transitions. [2024-11-19 14:15:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 2061. [2024-11-19 14:15:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2061 states, 1345 states have (on average 1.0446096654275092) internal successors, (1405), 1344 states have internal predecessors, (1405), 420 states have call successors, (453), 202 states have call predecessors, (453), 296 states have return successors, (1074), 514 states have call predecessors, (1074), 420 states have call successors, (1074) [2024-11-19 14:15:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 2932 transitions. [2024-11-19 14:15:38,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2061 states and 2932 transitions. [2024-11-19 14:15:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 14:15:38,442 INFO L425 stractBuchiCegarLoop]: Abstraction has 2061 states and 2932 transitions. [2024-11-19 14:15:38,442 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-19 14:15:38,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2061 states and 2932 transitions. [2024-11-19 14:15:38,448 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 142 [2024-11-19 14:15:38,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:38,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:38,450 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-19 14:15:38,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 21, 21, 21, 21, 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-19 14:15:38,450 INFO L745 eck$LassoCheckResult]: Stem: 83947#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 83890#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; 83891#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; 83912#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; 83948#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 84531#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84529#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; 83888#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 83889#$Ultimate##0 ~n := #in~n; 84478#L25 assume ~n <= 0;#res := 1; 84477#factFINAL assume true; 84475#factEXIT >#72#return; 83932#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 83933#$Ultimate##0 ~n := #in~n; 84503#L25 assume ~n <= 0;#res := 1; 84502#factFINAL assume true; 84492#factEXIT >#74#return; 83876#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 83877#$Ultimate##0 ~n := #in~n; 84534#L25 assume ~n <= 0;#res := 1; 84532#factFINAL assume true; 84494#factEXIT >#76#return; 83910#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; 83911#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; 83923#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 84609#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84607#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; 84596#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 84599#$Ultimate##0 ~n := #in~n; 84613#L25 assume !(~n <= 0); 84611#L26 call #t~ret0 := fact(~n - 1);< 84612#$Ultimate##0 ~n := #in~n; 84616#L25 assume ~n <= 0;#res := 1; 84614#factFINAL assume true; 84610#factEXIT >#70#return; 84608#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84606#factFINAL assume true; 84595#factEXIT >#78#return; 84598#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 84601#$Ultimate##0 ~n := #in~n; 84605#L25 assume ~n <= 0;#res := 1; 84604#factFINAL assume true; 84600#factEXIT >#80#return; 84597#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 84599#$Ultimate##0 ~n := #in~n; 84613#L25 assume !(~n <= 0); 84611#L26 call #t~ret0 := fact(~n - 1);< 84612#$Ultimate##0 ~n := #in~n; 84616#L25 assume ~n <= 0;#res := 1; 84614#factFINAL assume true; 84610#factEXIT >#70#return; 84608#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84606#factFINAL assume true; 84595#factEXIT >#82#return; 84594#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; 84593#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; 84591#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 84589#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 84588#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; 84562#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 84564#$Ultimate##0 ~n := #in~n; 84784#L25 assume !(~n <= 0); 84619#L26 call #t~ret0 := fact(~n - 1);< 84625#$Ultimate##0 ~n := #in~n; 84766#L25 assume !(~n <= 0); 84618#L26 call #t~ret0 := fact(~n - 1);< 84638#$Ultimate##0 ~n := #in~n; 84673#L25 assume ~n <= 0;#res := 1; 84666#factFINAL assume true; 84637#factEXIT >#70#return; 84635#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84626#factFINAL assume true; 84617#factEXIT >#70#return; 84615#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84583#factFINAL assume true; 84558#factEXIT >#78#return; 84547#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 84550#$Ultimate##0 ~n := #in~n; 84582#L25 assume ~n <= 0;#res := 1; 84554#factFINAL assume true; 84546#factEXIT >#80#return; 84513#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 84515#$Ultimate##0 ~n := #in~n; 84641#L25 assume !(~n <= 0); 84576#L26 call #t~ret0 := fact(~n - 1);< 84581#$Ultimate##0 ~n := #in~n; 84674#L25 assume !(~n <= 0); 84577#L26 call #t~ret0 := fact(~n - 1);< 84640#$Ultimate##0 ~n := #in~n; 84643#L25 assume ~n <= 0;#res := 1; 84642#factFINAL assume true; 84639#factEXIT >#70#return; 84636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84634#factFINAL assume true; 84572#factEXIT >#70#return; 84553#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 84552#factFINAL assume true; 84545#factEXIT >#82#return; 84542#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; 84508#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; 84509#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 84069#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 84068#L42-4 havoc main_~k~0#1; 83906#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 83907#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 84106#L42-3 [2024-11-19 14:15:38,450 INFO L747 eck$LassoCheckResult]: Loop: 84106#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85229#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; 85219#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85225#$Ultimate##0 ~n := #in~n; 85230#L25 assume !(~n <= 0); 85133#L26 call #t~ret0 := fact(~n - 1);< 85171#$Ultimate##0 ~n := #in~n; 85152#L25 assume !(~n <= 0); 85127#L26 call #t~ret0 := fact(~n - 1);< 85151#$Ultimate##0 ~n := #in~n; 85154#L25 assume ~n <= 0;#res := 1; 85312#factFINAL assume true; 85310#factEXIT >#70#return; 85311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85360#factFINAL assume true; 85343#factEXIT >#70#return; 85138#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85224#factFINAL assume true; 85215#factEXIT >#72#return; 85221#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85225#$Ultimate##0 ~n := #in~n; 85230#L25 assume ~n <= 0;#res := 1; 85228#factFINAL assume true; 85226#factEXIT >#74#return; 85218#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85223#$Ultimate##0 ~n := #in~n; 85234#L25 assume !(~n <= 0); 85129#L26 call #t~ret0 := fact(~n - 1);< 85153#$Ultimate##0 ~n := #in~n; 85152#L25 assume !(~n <= 0); 85127#L26 call #t~ret0 := fact(~n - 1);< 85151#$Ultimate##0 ~n := #in~n; 85154#L25 assume ~n <= 0;#res := 1; 85312#factFINAL assume true; 85310#factEXIT >#70#return; 85311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85360#factFINAL assume true; 85343#factEXIT >#70#return; 85138#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85224#factFINAL assume true; 85215#factEXIT >#76#return; 85222#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; 85244#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; 85245#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 85239#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85240#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; 85087#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85121#$Ultimate##0 ~n := #in~n; 85182#L25 assume !(~n <= 0); 85128#L26 call #t~ret0 := fact(~n - 1);< 85171#$Ultimate##0 ~n := #in~n; 85152#L25 assume !(~n <= 0); 85127#L26 call #t~ret0 := fact(~n - 1);< 85151#$Ultimate##0 ~n := #in~n; 85154#L25 assume ~n <= 0;#res := 1; 85312#factFINAL assume true; 85310#factEXIT >#70#return; 85311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85360#factFINAL assume true; 85343#factEXIT >#70#return; 85345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85876#factFINAL assume true; 85873#factEXIT >#72#return; 85102#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85121#$Ultimate##0 ~n := #in~n; 85182#L25 assume !(~n <= 0); 85128#L26 call #t~ret0 := fact(~n - 1);< 85171#$Ultimate##0 ~n := #in~n; 85152#L25 assume !(~n <= 0); 85127#L26 call #t~ret0 := fact(~n - 1);< 85151#$Ultimate##0 ~n := #in~n; 85154#L25 assume ~n <= 0;#res := 1; 85312#factFINAL assume true; 85310#factEXIT >#70#return; 85311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85360#factFINAL assume true; 85343#factEXIT >#70#return; 85345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85876#factFINAL assume true; 85873#factEXIT >#74#return; 85095#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85121#$Ultimate##0 ~n := #in~n; 85182#L25 assume !(~n <= 0); 85128#L26 call #t~ret0 := fact(~n - 1);< 85171#$Ultimate##0 ~n := #in~n; 85175#L25 assume ~n <= 0;#res := 1; 85172#factFINAL assume true; 85164#factEXIT >#70#return; 85163#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85162#factFINAL assume true; 85070#factEXIT >#76#return; 85108#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; 85266#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; 85267#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 85898#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85259#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; 85088#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85121#$Ultimate##0 ~n := #in~n; 85182#L25 assume !(~n <= 0); 85128#L26 call #t~ret0 := fact(~n - 1);< 85171#$Ultimate##0 ~n := #in~n; 85152#L25 assume !(~n <= 0); 85127#L26 call #t~ret0 := fact(~n - 1);< 85151#$Ultimate##0 ~n := #in~n; 85154#L25 assume ~n <= 0;#res := 1; 85312#factFINAL assume true; 85310#factEXIT >#70#return; 85311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85360#factFINAL assume true; 85343#factEXIT >#70#return; 85345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85876#factFINAL assume true; 85873#factEXIT >#72#return; 85077#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85121#$Ultimate##0 ~n := #in~n; 85182#L25 assume !(~n <= 0); 85128#L26 call #t~ret0 := fact(~n - 1);< 85171#$Ultimate##0 ~n := #in~n; 85175#L25 assume ~n <= 0;#res := 1; 85172#factFINAL assume true; 85164#factEXIT >#70#return; 85163#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85162#factFINAL assume true; 85070#factEXIT >#74#return; 85091#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85121#$Ultimate##0 ~n := #in~n; 85182#L25 assume ~n <= 0;#res := 1; 85158#factFINAL assume true; 85177#factEXIT >#76#return; 85178#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; 85197#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; 85897#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 85896#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85184#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; 85100#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85121#$Ultimate##0 ~n := #in~n; 85182#L25 assume !(~n <= 0); 85128#L26 call #t~ret0 := fact(~n - 1);< 85171#$Ultimate##0 ~n := #in~n; 85152#L25 assume !(~n <= 0); 85127#L26 call #t~ret0 := fact(~n - 1);< 85151#$Ultimate##0 ~n := #in~n; 85154#L25 assume ~n <= 0;#res := 1; 85312#factFINAL assume true; 85310#factEXIT >#70#return; 85311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85360#factFINAL assume true; 85343#factEXIT >#70#return; 85345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85876#factFINAL assume true; 85873#factEXIT >#78#return; 85078#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85159#$Ultimate##0 ~n := #in~n; 85157#L25 assume !(~n <= 0); 85140#L26 call #t~ret0 := fact(~n - 1);< 85141#$Ultimate##0 ~n := #in~n; 85175#L25 assume ~n <= 0;#res := 1; 85172#factFINAL assume true; 85164#factEXIT >#70#return; 85163#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85162#factFINAL assume true; 85070#factEXIT >#80#return; 85086#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85112#$Ultimate##0 ~n := #in~n; 85142#L25 assume !(~n <= 0); 85128#L26 call #t~ret0 := fact(~n - 1);< 85171#$Ultimate##0 ~n := #in~n; 85175#L25 assume ~n <= 0;#res := 1; 85172#factFINAL assume true; 85164#factEXIT >#70#return; 85163#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85162#factFINAL assume true; 85070#factEXIT >#82#return; 85111#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; 85233#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; 85195#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 85196#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85189#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; 85103#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85112#$Ultimate##0 ~n := #in~n; 85142#L25 assume !(~n <= 0); 85128#L26 call #t~ret0 := fact(~n - 1);< 85171#$Ultimate##0 ~n := #in~n; 85152#L25 assume !(~n <= 0); 85127#L26 call #t~ret0 := fact(~n - 1);< 85151#$Ultimate##0 ~n := #in~n; 85154#L25 assume ~n <= 0;#res := 1; 85312#factFINAL assume true; 85310#factEXIT >#70#return; 85311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85360#factFINAL assume true; 85343#factEXIT >#70#return; 85345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85876#factFINAL assume true; 85873#factEXIT >#78#return; 85082#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85159#$Ultimate##0 ~n := #in~n; 85157#L25 assume !(~n <= 0); 85140#L26 call #t~ret0 := fact(~n - 1);< 85141#$Ultimate##0 ~n := #in~n; 85175#L25 assume ~n <= 0;#res := 1; 85172#factFINAL assume true; 85164#factEXIT >#70#return; 85163#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85162#factFINAL assume true; 85070#factEXIT >#80#return; 85096#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85112#$Ultimate##0 ~n := #in~n; 85142#L25 assume !(~n <= 0); 85128#L26 call #t~ret0 := fact(~n - 1);< 85171#$Ultimate##0 ~n := #in~n; 85152#L25 assume !(~n <= 0); 85127#L26 call #t~ret0 := fact(~n - 1);< 85151#$Ultimate##0 ~n := #in~n; 85154#L25 assume ~n <= 0;#res := 1; 85312#factFINAL assume true; 85310#factEXIT >#70#return; 85311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85360#factFINAL assume true; 85343#factEXIT >#70#return; 85345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85876#factFINAL assume true; 85873#factEXIT >#82#return; 85068#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; 85069#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; 85198#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 85192#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 83957#L42-4 havoc main_~k~0#1; 83904#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 83905#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 84106#L42-3 [2024-11-19 14:15:38,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:38,451 INFO L85 PathProgramCache]: Analyzing trace with hash 157168703, now seen corresponding path program 5 times [2024-11-19 14:15:38,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:38,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753205752] [2024-11-19 14:15:38,451 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:38,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:38,471 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-11-19 14:15:38,472 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:15:38,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896285300] [2024-11-19 14:15:38,473 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:38,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:38,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:38,475 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-19 14:15:38,477 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-19 14:15:38,610 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-11-19 14:15:38,610 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:38,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:38,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:38,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:38,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1879019682, now seen corresponding path program 9 times [2024-11-19 14:15:38,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:38,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395678880] [2024-11-19 14:15:38,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:38,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:38,689 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-19 14:15:38,689 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2995 backedges. 699 proven. 210 refuted. 0 times theorem prover too weak. 2086 trivial. 0 not checked. [2024-11-19 14:15:38,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:38,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395678880] [2024-11-19 14:15:38,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395678880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:38,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577001058] [2024-11-19 14:15:38,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:38,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:38,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:38,973 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-19 14:15:38,975 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-19 14:15:39,123 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-19 14:15:39,123 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:39,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 14:15:39,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2995 backedges. 849 proven. 129 refuted. 0 times theorem prover too weak. 2017 trivial. 0 not checked. [2024-11-19 14:15:39,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2995 backedges. 377 proven. 179 refuted. 0 times theorem prover too weak. 2439 trivial. 0 not checked. [2024-11-19 14:15:39,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577001058] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:39,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:39,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 13] total 21 [2024-11-19 14:15:39,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286730989] [2024-11-19 14:15:39,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:39,647 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:15:39,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:39,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 14:15:39,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-19 14:15:39,648 INFO L87 Difference]: Start difference. First operand 2061 states and 2932 transitions. cyclomatic complexity: 904 Second operand has 21 states, 15 states have (on average 3.933333333333333) internal successors, (59), 20 states have internal predecessors, (59), 15 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (27), 9 states have call predecessors, (27), 15 states have call successors, (27) [2024-11-19 14:15:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:40,185 INFO L93 Difference]: Finished difference Result 2175 states and 3033 transitions. [2024-11-19 14:15:40,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2175 states and 3033 transitions. [2024-11-19 14:15:40,195 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 117 [2024-11-19 14:15:40,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2175 states to 1850 states and 2463 transitions. [2024-11-19 14:15:40,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 473 [2024-11-19 14:15:40,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 473 [2024-11-19 14:15:40,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1850 states and 2463 transitions. [2024-11-19 14:15:40,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:40,210 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1850 states and 2463 transitions. [2024-11-19 14:15:40,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states and 2463 transitions. [2024-11-19 14:15:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1762. [2024-11-19 14:15:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1164 states have (on average 1.041237113402062) internal successors, (1212), 1164 states have internal predecessors, (1212), 315 states have call successors, (348), 191 states have call predecessors, (348), 283 states have return successors, (791), 406 states have call predecessors, (791), 315 states have call successors, (791) [2024-11-19 14:15:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2351 transitions. [2024-11-19 14:15:40,250 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1762 states and 2351 transitions. [2024-11-19 14:15:40,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 14:15:40,251 INFO L425 stractBuchiCegarLoop]: Abstraction has 1762 states and 2351 transitions. [2024-11-19 14:15:40,251 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-19 14:15:40,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1762 states and 2351 transitions. [2024-11-19 14:15:40,256 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 106 [2024-11-19 14:15:40,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:40,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:40,258 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-19 14:15:40,258 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-19 14:15:40,258 INFO L745 eck$LassoCheckResult]: Stem: 89584#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 89530#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; 89531#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; 89553#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; 89585#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 89648#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 89871#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; 89868#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 89869#$Ultimate##0 ~n := #in~n; 89872#L25 assume ~n <= 0;#res := 1; 89870#factFINAL assume true; 89867#factEXIT >#72#return; 89574#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 89575#$Ultimate##0 ~n := #in~n; 89920#L25 assume ~n <= 0;#res := 1; 89919#factFINAL assume true; 89916#factEXIT >#74#return; 89516#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 89517#$Ultimate##0 ~n := #in~n; 89958#L25 assume ~n <= 0;#res := 1; 89957#factFINAL assume true; 89956#factEXIT >#76#return; 89955#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; 89560#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; 89561#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 90235#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 90234#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; 90128#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 90183#$Ultimate##0 ~n := #in~n; 90258#L25 assume !(~n <= 0); 90219#L26 call #t~ret0 := fact(~n - 1);< 90220#$Ultimate##0 ~n := #in~n; 90242#L25 assume ~n <= 0;#res := 1; 90241#factFINAL assume true; 90218#factEXIT >#70#return; 90209#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90210#factFINAL assume true; 90126#factEXIT >#78#return; 90129#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 90236#$Ultimate##0 ~n := #in~n; 90240#L25 assume ~n <= 0;#res := 1; 90187#factFINAL assume true; 90188#factEXIT >#80#return; 90127#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 90183#$Ultimate##0 ~n := #in~n; 90258#L25 assume !(~n <= 0); 90219#L26 call #t~ret0 := fact(~n - 1);< 90220#$Ultimate##0 ~n := #in~n; 90242#L25 assume ~n <= 0;#res := 1; 90241#factFINAL assume true; 90218#factEXIT >#70#return; 90209#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90210#factFINAL assume true; 90126#factEXIT >#82#return; 89532#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; 89533#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; 90347#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 90346#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 90345#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; 90343#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 90344#$Ultimate##0 ~n := #in~n; 90635#L25 assume !(~n <= 0); 90400#L26 call #t~ret0 := fact(~n - 1);< 90394#$Ultimate##0 ~n := #in~n; 90402#L25 assume !(~n <= 0); 90398#L26 call #t~ret0 := fact(~n - 1);< 90401#$Ultimate##0 ~n := #in~n; 90691#L25 assume ~n <= 0;#res := 1; 90689#factFINAL assume true; 90686#factEXIT >#70#return; 90683#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90679#factFINAL assume true; 90410#factEXIT >#70#return; 90388#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90389#factFINAL assume true; 90404#factEXIT >#78#return; 90650#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 90663#$Ultimate##0 ~n := #in~n; 90705#L25 assume ~n <= 0;#res := 1; 90703#factFINAL assume true; 90697#factEXIT >#80#return; 90384#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 90694#$Ultimate##0 ~n := #in~n; 90669#L25 assume !(~n <= 0); 90373#L26 call #t~ret0 := fact(~n - 1);< 90632#$Ultimate##0 ~n := #in~n; 90657#L25 assume !(~n <= 0); 90374#L26 call #t~ret0 := fact(~n - 1);< 90630#$Ultimate##0 ~n := #in~n; 90655#L25 assume ~n <= 0;#res := 1; 90647#factFINAL assume true; 90644#factEXIT >#70#return; 90641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90640#factFINAL assume true; 90637#factEXIT >#70#return; 90639#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90696#factFINAL assume true; 90693#factEXIT >#82#return; 90692#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; 90690#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; 90687#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 90684#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 90680#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; 90321#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 90322#$Ultimate##0 ~n := #in~n; 90642#L25 assume !(~n <= 0); 90370#L26 call #t~ret0 := fact(~n - 1);< 90632#$Ultimate##0 ~n := #in~n; 90657#L25 assume !(~n <= 0); 90374#L26 call #t~ret0 := fact(~n - 1);< 90630#$Ultimate##0 ~n := #in~n; 90657#L25 assume !(~n <= 0); 90374#L26 call #t~ret0 := fact(~n - 1);< 90630#$Ultimate##0 ~n := #in~n; 90655#L25 assume ~n <= 0;#res := 1; 90647#factFINAL assume true; 90644#factEXIT >#70#return; 90641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90640#factFINAL assume true; 90637#factEXIT >#70#return; 90636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90631#factFINAL assume true; 90624#factEXIT >#70#return; 90625#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90656#factFINAL assume true; 90403#factEXIT >#78#return; 89525#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 89578#$Ultimate##0 ~n := #in~n; 89570#L25 assume ~n <= 0;#res := 1; 89524#factFINAL assume true; 89526#factEXIT >#80#return; 89537#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 89586#$Ultimate##0 ~n := #in~n; 90222#L25 assume !(~n <= 0); 89536#L26 call #t~ret0 := fact(~n - 1);< 89538#$Ultimate##0 ~n := #in~n; 90226#L25 assume !(~n <= 0); 89511#L26 call #t~ret0 := fact(~n - 1);< 90225#$Ultimate##0 ~n := #in~n; 90227#L25 assume ~n <= 0;#res := 1; 90295#factFINAL assume true; 89510#factEXIT >#70#return; 89512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 89565#factFINAL assume true; 90247#factEXIT >#70#return; 90239#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90246#factFINAL assume true; 90232#factEXIT >#82#return; 90230#L30-8 [2024-11-19 14:15:40,258 INFO L747 eck$LassoCheckResult]: Loop: 90230#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; 90229#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; 90221#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 90217#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 90208#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; 89506#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 89507#$Ultimate##0 ~n := #in~n; 90249#L25 assume !(~n <= 0); 89564#L26 call #t~ret0 := fact(~n - 1);< 89538#$Ultimate##0 ~n := #in~n; 90226#L25 assume !(~n <= 0); 89511#L26 call #t~ret0 := fact(~n - 1);< 90225#$Ultimate##0 ~n := #in~n; 90226#L25 assume !(~n <= 0); 89511#L26 call #t~ret0 := fact(~n - 1);< 90225#$Ultimate##0 ~n := #in~n; 90226#L25 assume !(~n <= 0); 89511#L26 call #t~ret0 := fact(~n - 1);< 90225#$Ultimate##0 ~n := #in~n; 90226#L25 assume !(~n <= 0); 89511#L26 call #t~ret0 := fact(~n - 1);< 90225#$Ultimate##0 ~n := #in~n; 90226#L25 assume !(~n <= 0); 89511#L26 call #t~ret0 := fact(~n - 1);< 90225#$Ultimate##0 ~n := #in~n; 90226#L25 assume !(~n <= 0); 89511#L26 call #t~ret0 := fact(~n - 1);< 90225#$Ultimate##0 ~n := #in~n; 90227#L25 assume ~n <= 0;#res := 1; 90295#factFINAL assume true; 89510#factEXIT >#70#return; 89512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 89565#factFINAL assume true; 90247#factEXIT >#70#return; 90248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90276#factFINAL assume true; 90275#factEXIT >#70#return; 90273#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90271#factFINAL assume true; 90269#factEXIT >#70#return; 90268#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90265#factFINAL assume true; 90262#factEXIT >#70#return; 90261#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90259#factFINAL assume true; 90244#factEXIT >#70#return; 90238#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90223#factFINAL assume true; 90224#factEXIT >#70#return; 90237#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90180#factFINAL assume true; 90182#factEXIT >#78#return; 89580#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 89581#$Ultimate##0 ~n := #in~n; 90191#L25 assume ~n <= 0;#res := 1; 90192#factFINAL assume true; 90186#factEXIT >#80#return; 90181#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 90233#$Ultimate##0 ~n := #in~n; 90228#L25 assume !(~n <= 0); 89563#L26 call #t~ret0 := fact(~n - 1);< 89538#$Ultimate##0 ~n := #in~n; 90226#L25 assume !(~n <= 0); 89511#L26 call #t~ret0 := fact(~n - 1);< 90225#$Ultimate##0 ~n := #in~n; 90227#L25 assume ~n <= 0;#res := 1; 90295#factFINAL assume true; 89510#factEXIT >#70#return; 89512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 89565#factFINAL assume true; 90247#factEXIT >#70#return; 90245#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 90243#factFINAL assume true; 90231#factEXIT >#82#return; 90230#L30-8 [2024-11-19 14:15:40,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1182061097, now seen corresponding path program 8 times [2024-11-19 14:15:40,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:40,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982922192] [2024-11-19 14:15:40,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:40,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:40,275 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:40,275 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:40,488 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-19 14:15:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:40,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982922192] [2024-11-19 14:15:40,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982922192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:40,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245629215] [2024-11-19 14:15:40,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:40,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:40,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:40,490 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-19 14:15:40,491 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-19 14:15:40,597 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:40,597 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:40,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:15:40,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:40,740 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-19 14:15:40,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:41,072 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-19 14:15:41,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245629215] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:41,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:41,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 20 [2024-11-19 14:15:41,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090759089] [2024-11-19 14:15:41,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:41,074 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:41,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1520673348, now seen corresponding path program 7 times [2024-11-19 14:15:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:41,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330875219] [2024-11-19 14:15:41,074 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:15:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 129 proven. 91 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-19 14:15:41,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:41,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330875219] [2024-11-19 14:15:41,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330875219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:41,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218283781] [2024-11-19 14:15:41,261 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:15:41,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:41,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:41,264 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-19 14:15:41,265 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-19 14:15:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:41,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 14:15:41,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 89 proven. 136 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-19 14:15:41,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 85 proven. 179 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 14:15:43,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218283781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:43,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:43,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 22] total 29 [2024-11-19 14:15:43,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801576202] [2024-11-19 14:15:43,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:43,061 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:15:43,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:43,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-19 14:15:43,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2024-11-19 14:15:43,062 INFO L87 Difference]: Start difference. First operand 1762 states and 2351 transitions. cyclomatic complexity: 622 Second operand has 30 states, 25 states have (on average 2.36) internal successors, (59), 24 states have internal predecessors, (59), 17 states have call successors, (18), 1 states have call predecessors, (18), 11 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2024-11-19 14:15:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:44,010 INFO L93 Difference]: Finished difference Result 2862 states and 4502 transitions. [2024-11-19 14:15:44,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2862 states and 4502 transitions. [2024-11-19 14:15:44,029 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 230 [2024-11-19 14:15:44,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2862 states to 2775 states and 4406 transitions. [2024-11-19 14:15:44,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 694 [2024-11-19 14:15:44,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 694 [2024-11-19 14:15:44,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2775 states and 4406 transitions. [2024-11-19 14:15:44,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:44,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2775 states and 4406 transitions. [2024-11-19 14:15:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states and 4406 transitions. [2024-11-19 14:15:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 2178. [2024-11-19 14:15:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2178 states, 1402 states have (on average 1.0342368045649073) internal successors, (1450), 1398 states have internal predecessors, (1450), 479 states have call successors, (512), 298 states have call predecessors, (512), 297 states have return successors, (1347), 481 states have call predecessors, (1347), 479 states have call successors, (1347) [2024-11-19 14:15:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 3309 transitions. [2024-11-19 14:15:44,122 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2178 states and 3309 transitions. [2024-11-19 14:15:44,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 14:15:44,123 INFO L425 stractBuchiCegarLoop]: Abstraction has 2178 states and 3309 transitions. [2024-11-19 14:15:44,123 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-11-19 14:15:44,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2178 states and 3309 transitions. [2024-11-19 14:15:44,130 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 134 [2024-11-19 14:15:44,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:44,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:44,132 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-19 14:15:44,133 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-19 14:15:44,134 INFO L745 eck$LassoCheckResult]: Stem: 95610#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 95550#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; 95551#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; 95572#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; 95611#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 95779#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 96968#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; 96965#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 96966#$Ultimate##0 ~n := #in~n; 96969#L25 assume ~n <= 0;#res := 1; 96967#factFINAL assume true; 96964#factEXIT >#72#return; 95595#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 95596#$Ultimate##0 ~n := #in~n; 97023#L25 assume ~n <= 0;#res := 1; 97021#factFINAL assume true; 97018#factEXIT >#74#return; 96997#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 96998#$Ultimate##0 ~n := #in~n; 97024#L25 assume ~n <= 0;#res := 1; 97022#factFINAL assume true; 96996#factEXIT >#76#return; 96995#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; 95586#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; 95587#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 95607#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 95577#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; 95578#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97142#$Ultimate##0 ~n := #in~n; 97141#L25 assume !(~n <= 0); 97102#L26 call #t~ret0 := fact(~n - 1);< 97140#$Ultimate##0 ~n := #in~n; 97137#L25 assume ~n <= 0;#res := 1; 97138#factFINAL assume true; 97101#factEXIT >#70#return; 97100#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97093#factFINAL assume true; 97095#factEXIT >#78#return; 95603#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 95604#$Ultimate##0 ~n := #in~n; 97107#L25 assume ~n <= 0;#res := 1; 97108#factFINAL assume true; 97099#factEXIT >#80#return; 97094#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97142#$Ultimate##0 ~n := #in~n; 97141#L25 assume !(~n <= 0); 97102#L26 call #t~ret0 := fact(~n - 1);< 97140#$Ultimate##0 ~n := #in~n; 97137#L25 assume ~n <= 0;#res := 1; 97138#factFINAL assume true; 97101#factEXIT >#70#return; 97100#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97093#factFINAL assume true; 97095#factEXIT >#82#return; 97146#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; 97212#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; 97211#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 97209#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97200#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; 97195#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97197#$Ultimate##0 ~n := #in~n; 97210#L25 assume !(~n <= 0); 97202#L26 call #t~ret0 := fact(~n - 1);< 97208#$Ultimate##0 ~n := #in~n; 97219#L25 assume !(~n <= 0); 97204#L26 call #t~ret0 := fact(~n - 1);< 97218#$Ultimate##0 ~n := #in~n; 97237#L25 assume ~n <= 0;#res := 1; 97236#factFINAL assume true; 97217#factEXIT >#70#return; 97216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97213#factFINAL assume true; 97201#factEXIT >#70#return; 97199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97198#factFINAL assume true; 97192#factEXIT >#78#return; 97196#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97178#$Ultimate##0 ~n := #in~n; 97412#L25 assume ~n <= 0;#res := 1; 97410#factFINAL assume true; 97393#factEXIT >#80#return; 95582#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97381#$Ultimate##0 ~n := #in~n; 97379#L25 assume !(~n <= 0); 97374#L26 call #t~ret0 := fact(~n - 1);< 97380#$Ultimate##0 ~n := #in~n; 97371#L25 assume !(~n <= 0); 97367#L26 call #t~ret0 := fact(~n - 1);< 97370#$Ultimate##0 ~n := #in~n; 97366#L25 assume ~n <= 0;#res := 1; 97368#factFINAL assume true; 97375#factEXIT >#70#return; 97376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97472#factFINAL assume true; 97465#factEXIT >#70#return; 97466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97654#factFINAL assume true; 97650#factEXIT >#82#return; 97648#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; 95575#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; 95576#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 97443#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97444#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; 97385#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97392#$Ultimate##0 ~n := #in~n; 97390#L25 assume !(~n <= 0); 97372#L26 call #t~ret0 := fact(~n - 1);< 97380#$Ultimate##0 ~n := #in~n; 97371#L25 assume !(~n <= 0); 97367#L26 call #t~ret0 := fact(~n - 1);< 97370#$Ultimate##0 ~n := #in~n; 97371#L25 assume !(~n <= 0); 97367#L26 call #t~ret0 := fact(~n - 1);< 97370#$Ultimate##0 ~n := #in~n; 97366#L25 assume ~n <= 0;#res := 1; 97368#factFINAL assume true; 97375#factEXIT >#70#return; 97376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97472#factFINAL assume true; 97465#factEXIT >#70#return; 97461#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97456#factFINAL assume true; 97449#factEXIT >#70#return; 97452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97441#factFINAL assume true; 97442#factEXIT >#78#return; 95590#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97434#$Ultimate##0 ~n := #in~n; 95589#L25 assume ~n <= 0;#res := 1; 95591#factFINAL assume true; 97308#factEXIT >#80#return; 95543#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 95612#$Ultimate##0 ~n := #in~n; 97109#L25 assume !(~n <= 0); 95555#L26 call #t~ret0 := fact(~n - 1);< 95556#$Ultimate##0 ~n := #in~n; 97189#L25 assume !(~n <= 0); 97125#L26 call #t~ret0 := fact(~n - 1);< 97169#$Ultimate##0 ~n := #in~n; 97190#L25 assume !(~n <= 0); 97128#L26 call #t~ret0 := fact(~n - 1);< 97187#$Ultimate##0 ~n := #in~n; 97191#L25 assume ~n <= 0;#res := 1; 97188#factFINAL assume true; 97186#factEXIT >#70#return; 97184#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97171#factFINAL assume true; 97167#factEXIT >#70#return; 97166#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97165#factFINAL assume true; 97163#factEXIT >#70#return; 95580#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95542#factFINAL assume true; 95544#factEXIT >#82#return; 95534#L30-8 [2024-11-19 14:15:44,134 INFO L747 eck$LassoCheckResult]: Loop: 95534#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; 95573#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; 95574#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 97145#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97144#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; 95528#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 95529#$Ultimate##0 ~n := #in~n; 97136#L25 assume !(~n <= 0); 97103#L26 call #t~ret0 := fact(~n - 1);< 97104#$Ultimate##0 ~n := #in~n; 97190#L25 assume !(~n <= 0); 97128#L26 call #t~ret0 := fact(~n - 1);< 97187#$Ultimate##0 ~n := #in~n; 97190#L25 assume !(~n <= 0); 97128#L26 call #t~ret0 := fact(~n - 1);< 97187#$Ultimate##0 ~n := #in~n; 97190#L25 assume !(~n <= 0); 97128#L26 call #t~ret0 := fact(~n - 1);< 97187#$Ultimate##0 ~n := #in~n; 97190#L25 assume !(~n <= 0); 97128#L26 call #t~ret0 := fact(~n - 1);< 97187#$Ultimate##0 ~n := #in~n; 97190#L25 assume !(~n <= 0); 97128#L26 call #t~ret0 := fact(~n - 1);< 97187#$Ultimate##0 ~n := #in~n; 97190#L25 assume !(~n <= 0); 97128#L26 call #t~ret0 := fact(~n - 1);< 97187#$Ultimate##0 ~n := #in~n; 97191#L25 assume ~n <= 0;#res := 1; 97188#factFINAL assume true; 97186#factEXIT >#70#return; 97184#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97171#factFINAL assume true; 97167#factEXIT >#70#return; 97166#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97165#factFINAL assume true; 97163#factEXIT >#70#return; 97162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97161#factFINAL assume true; 97158#factEXIT >#70#return; 97156#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97155#factFINAL assume true; 97153#factEXIT >#70#return; 97152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97151#factFINAL assume true; 97150#factEXIT >#70#return; 97139#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97124#factFINAL assume true; 97132#factEXIT >#70#return; 97149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97148#factFINAL assume true; 97087#factEXIT >#78#return; 97089#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97143#$Ultimate##0 ~n := #in~n; 97147#L25 assume ~n <= 0;#res := 1; 97105#factFINAL assume true; 97106#factEXIT >#80#return; 97088#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97096#$Ultimate##0 ~n := #in~n; 97122#L25 assume !(~n <= 0); 97123#L26 call #t~ret0 := fact(~n - 1);< 97160#$Ultimate##0 ~n := #in~n; 97157#L25 assume !(~n <= 0); 97126#L26 call #t~ret0 := fact(~n - 1);< 97133#$Ultimate##0 ~n := #in~n; 97170#L25 assume !(~n <= 0); 97127#L26 call #t~ret0 := fact(~n - 1);< 97154#$Ultimate##0 ~n := #in~n; 97235#L25 assume !(~n <= 0); 97129#L26 call #t~ret0 := fact(~n - 1);< 97159#$Ultimate##0 ~n := #in~n; 97172#L25 assume !(~n <= 0); 97131#L26 call #t~ret0 := fact(~n - 1);< 97164#$Ultimate##0 ~n := #in~n; 97189#L25 assume !(~n <= 0); 97125#L26 call #t~ret0 := fact(~n - 1);< 97169#$Ultimate##0 ~n := #in~n; 97190#L25 assume !(~n <= 0); 97128#L26 call #t~ret0 := fact(~n - 1);< 97187#$Ultimate##0 ~n := #in~n; 97191#L25 assume ~n <= 0;#res := 1; 97188#factFINAL assume true; 97186#factEXIT >#70#return; 97184#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97171#factFINAL assume true; 97167#factEXIT >#70#return; 97166#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97165#factFINAL assume true; 97163#factEXIT >#70#return; 97162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97161#factFINAL assume true; 97158#factEXIT >#70#return; 97156#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97155#factFINAL assume true; 97153#factEXIT >#70#return; 97152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97151#factFINAL assume true; 97150#factEXIT >#70#return; 97139#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97124#factFINAL assume true; 97132#factEXIT >#70#return; 97149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97148#factFINAL assume true; 97087#factEXIT >#82#return; 95534#L30-8 [2024-11-19 14:15:44,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:44,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1133326761, now seen corresponding path program 9 times [2024-11-19 14:15:44,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:44,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162685751] [2024-11-19 14:15:44,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:44,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:44,166 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 14:15:44,167 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:15:44,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [712898195] [2024-11-19 14:15:44,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:44,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:44,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:44,171 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-19 14:15:44,172 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-19 14:15:44,333 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 14:15:44,334 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:44,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:44,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:44,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:44,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1652380284, now seen corresponding path program 8 times [2024-11-19 14:15:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:44,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931749641] [2024-11-19 14:15:44,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:44,441 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:44,441 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 14:15:44,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737683479] [2024-11-19 14:15:44,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:44,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:44,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:44,448 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:44,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (192)] Waiting until timeout for monitored process [2024-11-19 14:15:44,695 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:44,695 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:44,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:44,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:44,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:44,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1270842332, now seen corresponding path program 10 times [2024-11-19 14:15:44,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:44,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530615277] [2024-11-19 14:15:44,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:44,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:44,797 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:44,798 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 556 proven. 285 refuted. 0 times theorem prover too weak. 3139 trivial. 0 not checked. [2024-11-19 14:15:45,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:45,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530615277] [2024-11-19 14:15:45,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530615277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:45,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106268101] [2024-11-19 14:15:45,171 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:45,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:45,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,176 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (193)] Waiting until timeout for monitored process [2024-11-19 14:15:45,350 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:45,350 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:45,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 14:15:45,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 1974 proven. 73 refuted. 0 times theorem prover too weak. 1933 trivial. 0 not checked. [2024-11-19 14:15:45,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 556 proven. 294 refuted. 0 times theorem prover too weak. 3130 trivial. 0 not checked. [2024-11-19 14:15:46,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106268101] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:46,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:46,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 18] total 21 [2024-11-19 14:15:46,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777436334] [2024-11-19 14:15:46,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:46,771 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:46,771 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:46,771 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:46,771 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:46,772 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:46,772 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,772 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:46,772 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:46,772 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration25_Loop [2024-11-19 14:15:46,772 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:46,772 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:46,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,853 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:46,853 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:46,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,856 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-19 14:15:46,858 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-19 14:15:46,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:46,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:46,887 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:46,887 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-19 14:15:46,909 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-19 14:15:46,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,915 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-19 14:15:46,917 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:46,918 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:46,918 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-19 14:15:46,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:46,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,973 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-19 14:15:46,974 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-19 14:15:46,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:46,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:46,990 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:47,003 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-19 14:15:47,004 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:47,004 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:47,004 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:47,004 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:47,004 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:47,004 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:47,004 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:47,004 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:47,004 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration25_Loop [2024-11-19 14:15:47,004 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:47,005 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:47,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,084 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:47,084 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:47,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:47,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:47,086 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-19 14:15:47,087 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-19 14:15:47,088 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-19 14:15:47,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:47,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:47,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:47,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:47,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:47,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:47,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:47,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:47,110 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-19 14:15:47,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:47,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:47,112 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-19 14:15:47,112 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-19 14:15:47,113 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-19 14:15:47,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:47,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:47,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:47,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:47,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:47,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:47,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:47,126 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:47,127 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:47,128 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:47,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:47,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:47,129 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-19 14:15:47,131 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-19 14:15:47,131 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:47,131 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:47,131 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:47,132 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-19 14:15:47,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2024-11-19 14:15:47,144 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:47,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:47,296 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-19 14:15:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:47,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-19 14:15:47,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:48,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-19 14:15:48,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:48,648 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-19 14:15:48,648 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-19 14:15:48,648 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2178 states and 3309 transitions. cyclomatic complexity: 1164 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-19 14:15:49,103 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2178 states and 3309 transitions. cyclomatic complexity: 1164. 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 4627 states and 6949 transitions. Complement of second has 109 states. [2024-11-19 14:15:49,104 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-19 14:15:49,104 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-19 14:15:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 92 transitions. [2024-11-19 14:15:49,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 92 transitions. Stem has 154 letters. Loop has 104 letters. [2024-11-19 14:15:49,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:49,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 92 transitions. Stem has 258 letters. Loop has 104 letters. [2024-11-19 14:15:49,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:49,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 92 transitions. Stem has 154 letters. Loop has 208 letters. [2024-11-19 14:15:49,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:49,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4627 states and 6949 transitions. [2024-11-19 14:15:49,134 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 134 [2024-11-19 14:15:49,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4627 states to 3083 states and 4689 transitions. [2024-11-19 14:15:49,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 568 [2024-11-19 14:15:49,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 574 [2024-11-19 14:15:49,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3083 states and 4689 transitions. [2024-11-19 14:15:49,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:49,167 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3083 states and 4689 transitions. [2024-11-19 14:15:49,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states and 4689 transitions. [2024-11-19 14:15:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2625. [2024-11-19 14:15:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2625 states, 1688 states have (on average 1.0296208530805686) internal successors, (1738), 1684 states have internal predecessors, (1738), 551 states have call successors, (596), 361 states have call predecessors, (596), 386 states have return successors, (1681), 579 states have call predecessors, (1681), 551 states have call successors, (1681) [2024-11-19 14:15:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 4015 transitions. [2024-11-19 14:15:49,241 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2625 states and 4015 transitions. [2024-11-19 14:15:49,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:49,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 14:15:49,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-11-19 14:15:49,242 INFO L87 Difference]: Start difference. First operand 2625 states and 4015 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 14 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (29), 12 states have call predecessors, (29), 14 states have call successors, (29) [2024-11-19 14:15:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:49,771 INFO L93 Difference]: Finished difference Result 3215 states and 5543 transitions. [2024-11-19 14:15:49,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3215 states and 5543 transitions. [2024-11-19 14:15:49,837 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 227 [2024-11-19 14:15:49,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3215 states to 3157 states and 5407 transitions. [2024-11-19 14:15:49,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 757 [2024-11-19 14:15:49,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 757 [2024-11-19 14:15:49,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3157 states and 5407 transitions. [2024-11-19 14:15:49,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:49,874 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3157 states and 5407 transitions. [2024-11-19 14:15:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3157 states and 5407 transitions. [2024-11-19 14:15:49,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3157 to 2787. [2024-11-19 14:15:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2787 states, 1783 states have (on average 1.0302860347728546) internal successors, (1837), 1779 states have internal predecessors, (1837), 608 states have call successors, (661), 361 states have call predecessors, (661), 396 states have return successors, (1906), 646 states have call predecessors, (1906), 608 states have call successors, (1906) [2024-11-19 14:15:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 4404 transitions. [2024-11-19 14:15:49,952 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2787 states and 4404 transitions. [2024-11-19 14:15:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 14:15:49,953 INFO L425 stractBuchiCegarLoop]: Abstraction has 2787 states and 4404 transitions. [2024-11-19 14:15:49,953 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-11-19 14:15:49,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2787 states and 4404 transitions. [2024-11-19 14:15:49,963 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 170 [2024-11-19 14:15:49,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:49,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:49,965 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 19, 10, 9, 9, 9, 9, 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-19 14:15:49,965 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [56, 56, 41, 41, 41, 41, 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-19 14:15:49,965 INFO L745 eck$LassoCheckResult]: Stem: 110814#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 110746#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; 110747#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; 110769#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; 110815#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 110983#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 110984#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; 111010#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111018#$Ultimate##0 ~n := #in~n; 111020#L25 assume ~n <= 0;#res := 1; 111019#factFINAL assume true; 111009#factEXIT >#72#return; 110805#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 110806#$Ultimate##0 ~n := #in~n; 111139#L25 assume ~n <= 0;#res := 1; 111135#factFINAL assume true; 111122#factEXIT >#74#return; 111113#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111169#$Ultimate##0 ~n := #in~n; 111176#L25 assume ~n <= 0;#res := 1; 111168#factFINAL assume true; 111112#factEXIT >#76#return; 111114#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; 110778#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; 110779#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 111300#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111295#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; 111287#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111290#$Ultimate##0 ~n := #in~n; 111303#L25 assume !(~n <= 0); 111298#L26 call #t~ret0 := fact(~n - 1);< 111299#$Ultimate##0 ~n := #in~n; 111304#L25 assume ~n <= 0;#res := 1; 111302#factFINAL assume true; 111297#factEXIT >#70#return; 111294#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111291#factFINAL assume true; 111286#factEXIT >#78#return; 111289#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111293#$Ultimate##0 ~n := #in~n; 111301#L25 assume ~n <= 0;#res := 1; 111296#factFINAL assume true; 111292#factEXIT >#80#return; 111288#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111290#$Ultimate##0 ~n := #in~n; 111303#L25 assume !(~n <= 0); 111298#L26 call #t~ret0 := fact(~n - 1);< 111299#$Ultimate##0 ~n := #in~n; 111304#L25 assume ~n <= 0;#res := 1; 111302#factFINAL assume true; 111297#factEXIT >#70#return; 111294#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111291#factFINAL assume true; 111286#factEXIT >#82#return; 111283#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; 111285#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; 112765#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 112764#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 112720#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; 112669#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 112695#$Ultimate##0 ~n := #in~n; 112696#L25 assume !(~n <= 0); 112675#L26 call #t~ret0 := fact(~n - 1);< 112680#$Ultimate##0 ~n := #in~n; 112711#L25 assume !(~n <= 0); 112674#L26 call #t~ret0 := fact(~n - 1);< 112710#$Ultimate##0 ~n := #in~n; 112707#L25 assume ~n <= 0;#res := 1; 112708#factFINAL assume true; 112697#factEXIT >#70#return; 112698#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 112727#factFINAL assume true; 112673#factEXIT >#70#return; 112672#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 112666#factFINAL assume true; 112671#factEXIT >#78#return; 112645#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 112739#$Ultimate##0 ~n := #in~n; 112658#L25 assume ~n <= 0;#res := 1; 112659#factFINAL assume true; 112644#factEXIT >#80#return; 112639#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 112967#$Ultimate##0 ~n := #in~n; 112966#L25 assume !(~n <= 0); 112960#L26 call #t~ret0 := fact(~n - 1);< 112997#$Ultimate##0 ~n := #in~n; 113115#L25 assume !(~n <= 0); 112959#L26 call #t~ret0 := fact(~n - 1);< 113113#$Ultimate##0 ~n := #in~n; 113117#L25 assume ~n <= 0;#res := 1; 113116#factFINAL assume true; 113112#factEXIT >#70#return; 113110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113107#factFINAL assume true; 112957#factEXIT >#70#return; 112963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113132#factFINAL assume true; 112638#factEXIT >#82#return; 111274#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; 111275#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; 111271#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 110828#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 110821#L42-4 havoc main_~k~0#1; 110767#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 110768#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 110761#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111514#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; 110781#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111512#$Ultimate##0 ~n := #in~n; 111515#L25 assume !(~n <= 0); 111383#L26 call #t~ret0 := fact(~n - 1);< 111417#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111440#L25 assume ~n <= 0;#res := 1; 111437#factFINAL assume true; 111435#factEXIT >#70#return; 111434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111431#factFINAL assume true; 111425#factEXIT >#70#return; 111427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111574#factFINAL assume true; 111375#factEXIT >#70#return; 110780#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 110794#factFINAL assume true; 111998#factEXIT >#72#return; 110792#L30-1 [2024-11-19 14:15:49,966 INFO L747 eck$LassoCheckResult]: Loop: 110792#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111512#$Ultimate##0 ~n := #in~n; 111515#L25 assume ~n <= 0;#res := 1; 111513#factFINAL assume true; 111511#factEXIT >#74#return; 110784#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111985#$Ultimate##0 ~n := #in~n; 111986#L25 assume !(~n <= 0); 111380#L26 call #t~ret0 := fact(~n - 1);< 111441#$Ultimate##0 ~n := #in~n; 111438#L25 assume !(~n <= 0); 111384#L26 call #t~ret0 := fact(~n - 1);< 111432#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111440#L25 assume ~n <= 0;#res := 1; 111437#factFINAL assume true; 111435#factEXIT >#70#return; 111434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111431#factFINAL assume true; 111425#factEXIT >#70#return; 111427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111574#factFINAL assume true; 111375#factEXIT >#70#return; 111396#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111555#factFINAL assume true; 111551#factEXIT >#70#return; 111550#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111549#factFINAL assume true; 111548#factEXIT >#70#return; 111547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111546#factFINAL assume true; 111543#factEXIT >#70#return; 111536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111540#factFINAL assume true; 111532#factEXIT >#70#return; 111535#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 112019#factFINAL assume true; 111750#factEXIT >#76#return; 111749#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; 111747#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; 111746#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 111745#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111742#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; 111360#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111368#$Ultimate##0 ~n := #in~n; 111433#L25 assume !(~n <= 0); 111392#L26 call #t~ret0 := fact(~n - 1);< 111430#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111440#L25 assume ~n <= 0;#res := 1; 111437#factFINAL assume true; 111435#factEXIT >#70#return; 111434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111431#factFINAL assume true; 111425#factEXIT >#70#return; 111427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111574#factFINAL assume true; 111375#factEXIT >#70#return; 111394#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111589#factFINAL assume true; 111584#factEXIT >#72#return; 111329#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111369#$Ultimate##0 ~n := #in~n; 111583#L25 assume !(~n <= 0); 111377#L26 call #t~ret0 := fact(~n - 1);< 111417#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111440#L25 assume ~n <= 0;#res := 1; 111437#factFINAL assume true; 111435#factEXIT >#70#return; 111434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111431#factFINAL assume true; 111425#factEXIT >#70#return; 111427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111574#factFINAL assume true; 111375#factEXIT >#70#return; 111396#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111555#factFINAL assume true; 111551#factEXIT >#70#return; 111553#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111649#factFINAL assume true; 111616#factEXIT >#74#return; 111338#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111369#$Ultimate##0 ~n := #in~n; 111583#L25 assume !(~n <= 0); 111377#L26 call #t~ret0 := fact(~n - 1);< 111417#$Ultimate##0 ~n := #in~n; 111421#L25 assume ~n <= 0;#res := 1; 111418#factFINAL assume true; 111409#factEXIT >#70#return; 111408#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111407#factFINAL assume true; 111305#factEXIT >#76#return; 111346#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; 111748#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; 111592#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 111591#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111590#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; 111364#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111368#$Ultimate##0 ~n := #in~n; 111433#L25 assume !(~n <= 0); 111392#L26 call #t~ret0 := fact(~n - 1);< 111430#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111440#L25 assume ~n <= 0;#res := 1; 111437#factFINAL assume true; 111435#factEXIT >#70#return; 111434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111431#factFINAL assume true; 111425#factEXIT >#70#return; 111427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111574#factFINAL assume true; 111375#factEXIT >#70#return; 111396#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111555#factFINAL assume true; 111551#factEXIT >#70#return; 111553#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111649#factFINAL assume true; 111616#factEXIT >#72#return; 111317#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111369#$Ultimate##0 ~n := #in~n; 111583#L25 assume !(~n <= 0); 111377#L26 call #t~ret0 := fact(~n - 1);< 111417#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111440#L25 assume ~n <= 0;#res := 1; 111437#factFINAL assume true; 111435#factEXIT >#70#return; 111434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111431#factFINAL assume true; 111425#factEXIT >#70#return; 111427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111574#factFINAL assume true; 111375#factEXIT >#70#return; 111394#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111589#factFINAL assume true; 111584#factEXIT >#74#return; 111331#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111369#$Ultimate##0 ~n := #in~n; 111583#L25 assume ~n <= 0;#res := 1; 111581#factFINAL assume true; 111566#factEXIT >#76#return; 111568#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; 111588#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; 111587#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 111586#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111585#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; 111339#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111369#$Ultimate##0 ~n := #in~n; 111583#L25 assume !(~n <= 0); 111377#L26 call #t~ret0 := fact(~n - 1);< 111417#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111440#L25 assume ~n <= 0;#res := 1; 111437#factFINAL assume true; 111435#factEXIT >#70#return; 111434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111431#factFINAL assume true; 111425#factEXIT >#70#return; 111427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111574#factFINAL assume true; 111375#factEXIT >#70#return; 111394#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111589#factFINAL assume true; 111584#factEXIT >#78#return; 111353#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111368#$Ultimate##0 ~n := #in~n; 111433#L25 assume !(~n <= 0); 111392#L26 call #t~ret0 := fact(~n - 1);< 111430#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111440#L25 assume ~n <= 0;#res := 1; 111437#factFINAL assume true; 111435#factEXIT >#70#return; 111434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111431#factFINAL assume true; 111425#factEXIT >#70#return; 111427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111574#factFINAL assume true; 111375#factEXIT >#70#return; 111396#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111555#factFINAL assume true; 111551#factEXIT >#70#return; 111553#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111649#factFINAL assume true; 111616#factEXIT >#80#return; 111333#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111372#$Ultimate##0 ~n := #in~n; 111420#L25 assume !(~n <= 0); 111377#L26 call #t~ret0 := fact(~n - 1);< 111417#$Ultimate##0 ~n := #in~n; 111421#L25 assume ~n <= 0;#res := 1; 111418#factFINAL assume true; 111409#factEXIT >#70#return; 111408#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111407#factFINAL assume true; 111305#factEXIT >#82#return; 111282#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; 111281#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; 111270#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 110822#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 110824#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; 111340#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111372#$Ultimate##0 ~n := #in~n; 111420#L25 assume !(~n <= 0); 111377#L26 call #t~ret0 := fact(~n - 1);< 111417#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111440#L25 assume ~n <= 0;#res := 1; 111437#factFINAL assume true; 111435#factEXIT >#70#return; 111434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111431#factFINAL assume true; 111425#factEXIT >#70#return; 111427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111574#factFINAL assume true; 111375#factEXIT >#70#return; 111394#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111589#factFINAL assume true; 111584#factEXIT >#78#return; 111358#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111368#$Ultimate##0 ~n := #in~n; 111433#L25 assume !(~n <= 0); 111392#L26 call #t~ret0 := fact(~n - 1);< 111430#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111440#L25 assume ~n <= 0;#res := 1; 111437#factFINAL assume true; 111435#factEXIT >#70#return; 111434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111431#factFINAL assume true; 111425#factEXIT >#70#return; 111427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111574#factFINAL assume true; 111375#factEXIT >#70#return; 111394#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111589#factFINAL assume true; 111584#factEXIT >#80#return; 111337#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111372#$Ultimate##0 ~n := #in~n; 111420#L25 assume !(~n <= 0); 111377#L26 call #t~ret0 := fact(~n - 1);< 111417#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111440#L25 assume ~n <= 0;#res := 1; 111437#factFINAL assume true; 111435#factEXIT >#70#return; 111434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111431#factFINAL assume true; 111425#factEXIT >#70#return; 111424#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111423#factFINAL assume true; 111403#factEXIT >#82#return; 111405#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; 111558#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; 111539#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 111531#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 110820#L42-4 havoc main_~k~0#1; 110766#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 110757#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 110758#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111883#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; 110735#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 110736#$Ultimate##0 ~n := #in~n; 111739#L25 assume !(~n <= 0); 111385#L26 call #t~ret0 := fact(~n - 1);< 111430#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111439#L25 assume !(~n <= 0); 111391#L26 call #t~ret0 := fact(~n - 1);< 111436#$Ultimate##0 ~n := #in~n; 111440#L25 assume ~n <= 0;#res := 1; 111437#factFINAL assume true; 111435#factEXIT >#70#return; 111434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111431#factFINAL assume true; 111425#factEXIT >#70#return; 111427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111574#factFINAL assume true; 111375#factEXIT >#70#return; 110780#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 110794#factFINAL assume true; 111998#factEXIT >#72#return; 110792#L30-1 [2024-11-19 14:15:49,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:49,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1169310377, now seen corresponding path program 6 times [2024-11-19 14:15:49,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:49,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102798343] [2024-11-19 14:15:49,968 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:15:49,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:49,985 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-19 14:15:49,986 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 186 proven. 14 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2024-11-19 14:15:50,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:50,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102798343] [2024-11-19 14:15:50,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102798343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:50,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622021813] [2024-11-19 14:15:50,088 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:15:50,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:50,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:50,091 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:50,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (200)] Waiting until timeout for monitored process [2024-11-19 14:15:50,236 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-19 14:15:50,236 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:50,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:15:50,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 186 proven. 14 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2024-11-19 14:15:50,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 186 proven. 18 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-19 14:15:50,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622021813] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:50,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:50,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 13 [2024-11-19 14:15:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652572140] [2024-11-19 14:15:50,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:50,626 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:50,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:50,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1234540220, now seen corresponding path program 10 times [2024-11-19 14:15:50,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:50,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730871235] [2024-11-19 14:15:50,626 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:50,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:50,663 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:50,664 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7855 backedges. 709 proven. 1211 refuted. 0 times theorem prover too weak. 5935 trivial. 0 not checked. [2024-11-19 14:15:51,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:51,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730871235] [2024-11-19 14:15:51,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730871235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:51,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37312632] [2024-11-19 14:15:51,426 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:51,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:51,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:51,427 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:51,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (201)] Waiting until timeout for monitored process [2024-11-19 14:15:51,624 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:51,624 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:51,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 14:15:51,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7855 backedges. 3856 proven. 106 refuted. 0 times theorem prover too weak. 3893 trivial. 0 not checked. [2024-11-19 14:15:51,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7855 backedges. 364 proven. 1414 refuted. 0 times theorem prover too weak. 6077 trivial. 0 not checked. [2024-11-19 14:15:52,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37312632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:52,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:52,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 20] total 32 [2024-11-19 14:15:52,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419123635] [2024-11-19 14:15:52,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:52,936 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:15:52,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:52,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 14:15:52,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-19 14:15:52,937 INFO L87 Difference]: Start difference. First operand 2787 states and 4404 transitions. cyclomatic complexity: 1654 Second operand has 14 states, 11 states have (on average 4.818181818181818) internal successors, (53), 13 states have internal predecessors, (53), 9 states have call successors, (19), 1 states have call predecessors, (19), 4 states have return successors, (20), 7 states have call predecessors, (20), 9 states have call successors, (20) [2024-11-19 14:15:53,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:53,238 INFO L93 Difference]: Finished difference Result 3539 states and 5921 transitions. [2024-11-19 14:15:53,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3539 states and 5921 transitions. [2024-11-19 14:15:53,268 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 250 [2024-11-19 14:15:53,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3539 states to 3530 states and 5911 transitions. [2024-11-19 14:15:53,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 986 [2024-11-19 14:15:53,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 986 [2024-11-19 14:15:53,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3530 states and 5911 transitions. [2024-11-19 14:15:53,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:53,316 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3530 states and 5911 transitions. [2024-11-19 14:15:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states and 5911 transitions. [2024-11-19 14:15:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 2991. [2024-11-19 14:15:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2991 states, 1902 states have (on average 1.0347003154574133) internal successors, (1968), 1903 states have internal predecessors, (1968), 693 states have call successors, (746), 361 states have call predecessors, (746), 396 states have return successors, (2115), 726 states have call predecessors, (2115), 693 states have call successors, (2115) [2024-11-19 14:15:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 4829 transitions. [2024-11-19 14:15:53,431 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2991 states and 4829 transitions. [2024-11-19 14:15:53,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 14:15:53,432 INFO L425 stractBuchiCegarLoop]: Abstraction has 2991 states and 4829 transitions. [2024-11-19 14:15:53,432 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-11-19 14:15:53,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2991 states and 4829 transitions. [2024-11-19 14:15:53,446 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 188 [2024-11-19 14:15:53,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:53,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:53,449 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [34, 34, 19, 19, 19, 19, 15, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:15:53,449 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 15, 15, 15, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:15:53,449 INFO L745 eck$LassoCheckResult]: Stem: 120055#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 119986#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; 119987#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; 120010#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; 119999#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 120001#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 120742#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; 119959#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 119960#$Ultimate##0 ~n := #in~n; 120461#L25 assume ~n <= 0;#res := 1; 120444#factFINAL assume true; 120434#factEXIT >#72#return; 120417#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 120418#$Ultimate##0 ~n := #in~n; 120431#L25 assume ~n <= 0;#res := 1; 120430#factFINAL assume true; 120416#factEXIT >#74#return; 120409#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 120410#$Ultimate##0 ~n := #in~n; 120415#L25 assume ~n <= 0;#res := 1; 120411#factFINAL assume true; 120408#factEXIT >#76#return; 120407#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; 120404#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; 120399#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 120398#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 120395#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; 119994#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 120384#$Ultimate##0 ~n := #in~n; 120756#L25 assume !(~n <= 0); 119992#L26 call #t~ret0 := fact(~n - 1);< 119995#$Ultimate##0 ~n := #in~n; 120633#L25 assume ~n <= 0;#res := 1; 120632#factFINAL assume true; 120630#factEXIT >#70#return; 120628#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120627#factFINAL assume true; 120382#factEXIT >#78#return; 120052#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 120053#$Ultimate##0 ~n := #in~n; 120721#L25 assume ~n <= 0;#res := 1; 120719#factFINAL assume true; 120716#factEXIT >#80#return; 119993#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 120384#$Ultimate##0 ~n := #in~n; 120756#L25 assume !(~n <= 0); 119992#L26 call #t~ret0 := fact(~n - 1);< 119995#$Ultimate##0 ~n := #in~n; 120633#L25 assume ~n <= 0;#res := 1; 120632#factFINAL assume true; 120630#factEXIT >#70#return; 120628#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120627#factFINAL assume true; 120382#factEXIT >#82#return; 120383#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; 120551#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; 120549#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 120545#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 120546#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; 120519#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 120525#$Ultimate##0 ~n := #in~n; 120538#L25 assume !(~n <= 0); 120533#L26 call #t~ret0 := fact(~n - 1);< 120537#$Ultimate##0 ~n := #in~n; 120550#L25 assume !(~n <= 0); 120534#L26 call #t~ret0 := fact(~n - 1);< 120548#$Ultimate##0 ~n := #in~n; 120672#L25 assume ~n <= 0;#res := 1; 120671#factFINAL assume true; 120547#factEXIT >#70#return; 120544#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120539#factFINAL assume true; 120530#factEXIT >#70#return; 120529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120527#factFINAL assume true; 120518#factEXIT >#78#return; 120523#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 120512#$Ultimate##0 ~n := #in~n; 121470#L25 assume ~n <= 0;#res := 1; 121462#factFINAL assume true; 121460#factEXIT >#80#return; 121453#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 121458#$Ultimate##0 ~n := #in~n; 121475#L25 assume !(~n <= 0); 121464#L26 call #t~ret0 := fact(~n - 1);< 121469#$Ultimate##0 ~n := #in~n; 121481#L25 assume !(~n <= 0); 121466#L26 call #t~ret0 := fact(~n - 1);< 121478#$Ultimate##0 ~n := #in~n; 121484#L25 assume ~n <= 0;#res := 1; 121479#factFINAL assume true; 121477#factEXIT >#70#return; 121476#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121471#factFINAL assume true; 121463#factEXIT >#70#return; 121461#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121459#factFINAL assume true; 121452#factEXIT >#82#return; 121451#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; 121450#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; 121449#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 121448#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 121447#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; 121445#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121446#$Ultimate##0 ~n := #in~n; 121487#L25 assume !(~n <= 0); 121467#L26 call #t~ret0 := fact(~n - 1);< 121469#$Ultimate##0 ~n := #in~n; 121481#L25 assume !(~n <= 0); 121466#L26 call #t~ret0 := fact(~n - 1);< 121478#$Ultimate##0 ~n := #in~n; 121481#L25 assume !(~n <= 0); 121466#L26 call #t~ret0 := fact(~n - 1);< 121478#$Ultimate##0 ~n := #in~n; 121484#L25 assume ~n <= 0;#res := 1; 121479#factFINAL assume true; 121477#factEXIT >#70#return; 121476#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121471#factFINAL assume true; 121463#factEXIT >#70#return; 121468#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121533#factFINAL assume true; 121528#factEXIT >#70#return; 121527#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121525#factFINAL assume true; 121521#factEXIT >#78#return; 121512#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121514#$Ultimate##0 ~n := #in~n; 121902#L25 assume ~n <= 0;#res := 1; 121900#factFINAL assume true; 121866#factEXIT >#80#return; 121622#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 121741#$Ultimate##0 ~n := #in~n; 121739#L25 assume !(~n <= 0); 121607#L26 call #t~ret0 := fact(~n - 1);< 121620#$Ultimate##0 ~n := #in~n; 121816#L25 assume !(~n <= 0); 121605#L26 call #t~ret0 := fact(~n - 1);< 121613#$Ultimate##0 ~n := #in~n; 121933#L25 assume !(~n <= 0); 121603#L26 call #t~ret0 := fact(~n - 1);< 121632#$Ultimate##0 ~n := #in~n; 121917#L25 assume ~n <= 0;#res := 1; 121636#factFINAL assume true; 121631#factEXIT >#70#return; 121630#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121627#factFINAL assume true; 121625#factEXIT >#70#return; 121624#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121621#factFINAL assume true; 121619#factEXIT >#70#return; 121611#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121877#factFINAL assume true; 121860#factEXIT >#82#return; 121861#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; 121931#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; 121640#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 121641#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 121633#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; 121440#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121441#$Ultimate##0 ~n := #in~n; 121617#L25 assume !(~n <= 0); 121604#L26 call #t~ret0 := fact(~n - 1);< 121613#$Ultimate##0 ~n := #in~n; 121933#L25 assume !(~n <= 0); 121603#L26 call #t~ret0 := fact(~n - 1);< 121632#$Ultimate##0 ~n := #in~n; 121933#L25 assume !(~n <= 0); 121603#L26 call #t~ret0 := fact(~n - 1);< 121632#$Ultimate##0 ~n := #in~n; 121933#L25 assume !(~n <= 0); 121603#L26 call #t~ret0 := fact(~n - 1);< 121632#$Ultimate##0 ~n := #in~n; 121917#L25 assume ~n <= 0;#res := 1; 121636#factFINAL assume true; 121631#factEXIT >#70#return; 121630#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121627#factFINAL assume true; 121625#factEXIT >#70#return; 121624#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121621#factFINAL assume true; 121619#factEXIT >#70#return; 121618#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121614#factFINAL assume true; 121601#factEXIT >#70#return; 121610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121904#factFINAL assume true; 121903#factEXIT >#78#return; 121434#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121871#$Ultimate##0 ~n := #in~n; 121433#L25 assume ~n <= 0;#res := 1; 121435#factFINAL assume true; 121664#factEXIT >#80#return; 120472#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 120479#$Ultimate##0 ~n := #in~n; 120478#L25 assume !(~n <= 0); 120446#L26 call #t~ret0 := fact(~n - 1);< 120473#$Ultimate##0 ~n := #in~n; 120575#L25 assume !(~n <= 0); 120447#L26 call #t~ret0 := fact(~n - 1);< 120502#$Ultimate##0 ~n := #in~n; 120660#L25 assume !(~n <= 0); 120456#L26 call #t~ret0 := fact(~n - 1);< 120658#$Ultimate##0 ~n := #in~n; 120667#L25 assume ~n <= 0;#res := 1; 120663#factFINAL assume true; 120657#factEXIT >#70#return; 120656#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120505#factFINAL assume true; 120500#factEXIT >#70#return; 120498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120494#factFINAL assume true; 120488#factEXIT >#70#return; 120457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120659#factFINAL assume true; 120508#factEXIT >#82#return; 120414#L30-8 [2024-11-19 14:15:53,450 INFO L747 eck$LassoCheckResult]: Loop: 120414#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; 120402#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; 120403#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 120442#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 120441#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; 120423#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 120440#$Ultimate##0 ~n := #in~n; 120474#L25 assume !(~n <= 0); 120450#L26 call #t~ret0 := fact(~n - 1);< 120460#$Ultimate##0 ~n := #in~n; 120660#L25 assume !(~n <= 0); 120456#L26 call #t~ret0 := fact(~n - 1);< 120658#$Ultimate##0 ~n := #in~n; 120660#L25 assume !(~n <= 0); 120456#L26 call #t~ret0 := fact(~n - 1);< 120658#$Ultimate##0 ~n := #in~n; 120660#L25 assume !(~n <= 0); 120456#L26 call #t~ret0 := fact(~n - 1);< 120658#$Ultimate##0 ~n := #in~n; 120660#L25 assume !(~n <= 0); 120456#L26 call #t~ret0 := fact(~n - 1);< 120658#$Ultimate##0 ~n := #in~n; 120660#L25 assume !(~n <= 0); 120456#L26 call #t~ret0 := fact(~n - 1);< 120658#$Ultimate##0 ~n := #in~n; 120660#L25 assume !(~n <= 0); 120456#L26 call #t~ret0 := fact(~n - 1);< 120658#$Ultimate##0 ~n := #in~n; 120660#L25 assume !(~n <= 0); 120456#L26 call #t~ret0 := fact(~n - 1);< 120658#$Ultimate##0 ~n := #in~n; 120667#L25 assume ~n <= 0;#res := 1; 120663#factFINAL assume true; 120657#factEXIT >#70#return; 120656#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120505#factFINAL assume true; 120500#factEXIT >#70#return; 120498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120494#factFINAL assume true; 120488#factEXIT >#70#return; 120487#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120485#factFINAL assume true; 120483#factEXIT >#70#return; 120481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120480#factFINAL assume true; 120476#factEXIT >#70#return; 120475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120471#factFINAL assume true; 120470#factEXIT >#70#return; 120469#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120467#factFINAL assume true; 120465#factEXIT >#70#return; 120458#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120462#factFINAL assume true; 120445#factEXIT >#70#return; 120443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120439#factFINAL assume true; 120422#factEXIT >#78#return; 120424#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 120429#$Ultimate##0 ~n := #in~n; 120433#L25 assume ~n <= 0;#res := 1; 120432#factFINAL assume true; 120428#factEXIT >#80#return; 120421#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 120427#$Ultimate##0 ~n := #in~n; 120468#L25 assume !(~n <= 0); 120449#L26 call #t~ret0 := fact(~n - 1);< 120463#$Ultimate##0 ~n := #in~n; 120504#L25 assume !(~n <= 0); 120451#L26 call #t~ret0 := fact(~n - 1);< 120464#$Ultimate##0 ~n := #in~n; 120526#L25 assume !(~n <= 0); 120454#L26 call #t~ret0 := fact(~n - 1);< 120477#$Ultimate##0 ~n := #in~n; 120528#L25 assume !(~n <= 0); 120448#L26 call #t~ret0 := fact(~n - 1);< 120484#$Ultimate##0 ~n := #in~n; 120578#L25 assume !(~n <= 0); 120452#L26 call #t~ret0 := fact(~n - 1);< 120489#$Ultimate##0 ~n := #in~n; 120575#L25 assume !(~n <= 0); 120447#L26 call #t~ret0 := fact(~n - 1);< 120502#$Ultimate##0 ~n := #in~n; 120660#L25 assume !(~n <= 0); 120456#L26 call #t~ret0 := fact(~n - 1);< 120658#$Ultimate##0 ~n := #in~n; 120667#L25 assume ~n <= 0;#res := 1; 120663#factFINAL assume true; 120657#factEXIT >#70#return; 120656#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120505#factFINAL assume true; 120500#factEXIT >#70#return; 120498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120494#factFINAL assume true; 120488#factEXIT >#70#return; 120487#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120485#factFINAL assume true; 120483#factEXIT >#70#return; 120481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120480#factFINAL assume true; 120476#factEXIT >#70#return; 120475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120471#factFINAL assume true; 120470#factEXIT >#70#return; 120469#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120467#factFINAL assume true; 120465#factEXIT >#70#return; 120466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 120607#factFINAL assume true; 120420#factEXIT >#82#return; 120414#L30-8 [2024-11-19 14:15:53,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash -179437148, now seen corresponding path program 11 times [2024-11-19 14:15:53,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:53,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261326099] [2024-11-19 14:15:53,451 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:53,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:53,501 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2024-11-19 14:15:53,502 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 558 proven. 159 refuted. 0 times theorem prover too weak. 1919 trivial. 0 not checked. [2024-11-19 14:15:53,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:53,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261326099] [2024-11-19 14:15:53,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261326099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:53,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693787164] [2024-11-19 14:15:53,948 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:53,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:53,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:53,953 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:53,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (202)] Waiting until timeout for monitored process [2024-11-19 14:15:54,473 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2024-11-19 14:15:54,473 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:54,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 14:15:54,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 558 proven. 156 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2024-11-19 14:15:54,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 560 proven. 166 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2024-11-19 14:15:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693787164] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:55,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:55,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 18] total 25 [2024-11-19 14:15:55,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364652931] [2024-11-19 14:15:55,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:55,331 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:55,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:55,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1704146172, now seen corresponding path program 9 times [2024-11-19 14:15:55,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:55,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968700076] [2024-11-19 14:15:55,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:55,346 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2024-11-19 14:15:55,346 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 140 proven. 454 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-19 14:15:55,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968700076] [2024-11-19 14:15:55,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968700076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154441483] [2024-11-19 14:15:55,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:55,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:55,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:55,862 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:55,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (203)] Waiting until timeout for monitored process [2024-11-19 14:15:56,021 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2024-11-19 14:15:56,021 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:56,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-19 14:15:56,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 127 proven. 434 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-11-19 14:15:56,151 INFO L311 TraceCheckSpWp]: Computing backward predicates...