./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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.3.0-?-8fc3dc6-m [2025-03-17 19:52:03,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:52:03,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:52:03,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:52:03,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:52:03,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:52:03,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:52:03,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:52:03,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:52:03,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:52:03,298 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:52:03,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:52:03,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:52:03,298 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:52:03,299 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:52:03,299 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:52:03,299 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:52:03,300 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:52:03,300 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:52:03,300 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:52:03,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:52:03,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:52:03,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:52:03,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:52:03,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:52:03,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:52:03,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:52:03,300 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:52:03,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:52:03,301 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:52:03,301 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:52:03,301 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:52:03,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:52:03,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:52:03,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:52:03,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:52:03,301 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:52:03,302 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 [2025-03-17 19:52:03,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:52:03,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:52:03,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:52:03,540 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:52:03,541 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:52:03,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Binomial.c [2025-03-17 19:52:04,632 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a91aa3942/32d0138e93a746a9938d4b2c42f1611c/FLAG24ed00b56 [2025-03-17 19:52:04,839 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:52:04,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2025-03-17 19:52:04,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a91aa3942/32d0138e93a746a9938d4b2c42f1611c/FLAG24ed00b56 [2025-03-17 19:52:05,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a91aa3942/32d0138e93a746a9938d4b2c42f1611c [2025-03-17 19:52:05,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:52:05,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:52:05,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:52:05,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:52:05,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:52:05,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:52:05" (1/1) ... [2025-03-17 19:52:05,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2913649e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05, skipping insertion in model container [2025-03-17 19:52:05,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:52:05" (1/1) ... [2025-03-17 19:52:05,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:52:05,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:52:05,325 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:52:05,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:52:05,350 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:52:05,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05 WrapperNode [2025-03-17 19:52:05,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:52:05,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:52:05,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:52:05,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:52:05,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05" (1/1) ... [2025-03-17 19:52:05,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05" (1/1) ... [2025-03-17 19:52:05,374 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-03-17 19:52:05,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:52:05,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:52:05,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:52:05,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:52:05,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05" (1/1) ... [2025-03-17 19:52:05,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05" (1/1) ... [2025-03-17 19:52:05,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05" (1/1) ... [2025-03-17 19:52:05,387 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 19:52:05,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05" (1/1) ... [2025-03-17 19:52:05,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05" (1/1) ... [2025-03-17 19:52:05,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05" (1/1) ... [2025-03-17 19:52:05,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05" (1/1) ... [2025-03-17 19:52:05,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05" (1/1) ... [2025-03-17 19:52:05,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05" (1/1) ... [2025-03-17 19:52:05,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:52:05,394 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:52:05,394 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:52:05,394 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:52:05,395 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05" (1/1) ... [2025-03-17 19:52:05,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:05,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:05,424 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) [2025-03-17 19:52:05,427 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 [2025-03-17 19:52:05,448 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2025-03-17 19:52:05,449 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2025-03-17 19:52:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:52:05,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:52:05,492 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:52:05,493 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:52:05,649 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30: havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; [2025-03-17 19:52:05,652 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30-6: havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; [2025-03-17 19:52:05,671 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 19:52:05,671 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:52:05,677 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:52:05,678 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:52:05,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:52:05 BoogieIcfgContainer [2025-03-17 19:52:05,678 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:52:05,678 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:52:05,678 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:52:05,682 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:52:05,683 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:52:05,683 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:52:05" (1/3) ... [2025-03-17 19:52:05,683 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8a4ade3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:52:05, skipping insertion in model container [2025-03-17 19:52:05,683 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:52:05,683 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:05" (2/3) ... [2025-03-17 19:52:05,684 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8a4ade3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:52:05, skipping insertion in model container [2025-03-17 19:52:05,684 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:52:05,684 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:52:05" (3/3) ... [2025-03-17 19:52:05,684 INFO L363 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2025-03-17 19:52:05,719 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:52:05,719 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:52:05,719 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:52:05,719 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:52:05,719 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:52:05,719 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:52:05,719 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:52:05,719 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:52:05,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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) [2025-03-17 19:52:05,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2025-03-17 19:52:05,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:05,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:05,743 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:52:05,743 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:52:05,743 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:52:05,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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) [2025-03-17 19:52:05,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2025-03-17 19:52:05,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:05,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:05,749 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:52:05,750 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:52:05,753 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" [2025-03-17 19:52:05,754 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-17 19:52:05,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash 67488, now seen corresponding path program 1 times [2025-03-17 19:52:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:05,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947750541] [2025-03-17 19:52:05,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:05,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:05,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:05,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:05,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:05,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:05,813 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:05,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:05,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:05,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:05,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:05,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:05,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1806, now seen corresponding path program 1 times [2025-03-17 19:52:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:05,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939549794] [2025-03-17 19:52:05,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:05,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:05,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:52:05,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:52:05,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:05,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:05,834 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:05,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:52:05,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:52:05,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:05,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:05,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:05,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash 64856813, now seen corresponding path program 1 times [2025-03-17 19:52:05,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:05,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069427343] [2025-03-17 19:52:05,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:05,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:05,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:05,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:05,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:05,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:05,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:05,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069427343] [2025-03-17 19:52:05,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069427343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:05,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:05,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:52:05,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82720157] [2025-03-17 19:52:05,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:05,962 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:05,963 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:05,963 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:05,963 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:05,963 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:05,963 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:05,963 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:05,963 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:05,963 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2025-03-17 19:52:05,964 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:05,964 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:05,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:05,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:05,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:06,034 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:06,034 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:06,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:06,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:06,040 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) [2025-03-17 19:52:06,048 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 [2025-03-17 19:52:06,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:06,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:06,063 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:06,063 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: [] [2025-03-17 19:52:06,069 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 [2025-03-17 19:52:06,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:06,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:06,072 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) [2025-03-17 19:52:06,074 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 [2025-03-17 19:52:06,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:06,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:06,086 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:06,087 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: [] [2025-03-17 19:52:06,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-17 19:52:06,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:06,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:06,100 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) [2025-03-17 19:52:06,101 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 [2025-03-17 19:52:06,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:06,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:06,121 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 [2025-03-17 19:52:06,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:06,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:06,123 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) [2025-03-17 19:52:06,124 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 [2025-03-17 19:52:06,125 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:06,125 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:06,198 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:06,204 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 [2025-03-17 19:52:06,204 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:06,204 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:06,204 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:06,204 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:06,204 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:06,204 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:06,204 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:06,204 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:06,204 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2025-03-17 19:52:06,204 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:06,204 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:06,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:06,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:06,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:06,255 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:06,258 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:06,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:06,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:06,262 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) [2025-03-17 19:52:06,264 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 [2025-03-17 19:52:06,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:06,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:06,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:06,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:06,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:06,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:06,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:06,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:06,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:06,289 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 [2025-03-17 19:52:06,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:06,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:06,291 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) [2025-03-17 19:52:06,292 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 [2025-03-17 19:52:06,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:06,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:06,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:06,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:06,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:06,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:06,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:06,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:06,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:06,313 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 [2025-03-17 19:52:06,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:06,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:06,315 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) [2025-03-17 19:52:06,316 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 [2025-03-17 19:52:06,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:06,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:06,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:06,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:06,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:06,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:06,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:06,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:06,332 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:06,336 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 19:52:06,342 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-17 19:52:06,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:06,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:06,346 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) [2025-03-17 19:52:06,348 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 [2025-03-17 19:52:06,348 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:06,348 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:06,348 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:06,349 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 [] [2025-03-17 19:52:06,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:06,360 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:06,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:06,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:06,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:06,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:06,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:06,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:06,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:06,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:52:06,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:52:06,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:06,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:06,406 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:06,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:06,456 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:52:06,457 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2025-03-17 19:52:06,498 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 40 states and 57 transitions. Complement of second has 5 states. [2025-03-17 19:52:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:06,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2025-03-17 19:52:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-17 19:52:06,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-17 19:52:06,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:06,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-17 19:52:06,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:06,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 3 letters. Loop has 4 letters. [2025-03-17 19:52:06,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:06,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 57 transitions. [2025-03-17 19:52:06,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2025-03-17 19:52:06,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 30 states and 44 transitions. [2025-03-17 19:52:06,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-17 19:52:06,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-17 19:52:06,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2025-03-17 19:52:06,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:06,515 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 44 transitions. [2025-03-17 19:52:06,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2025-03-17 19:52:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2025-03-17 19:52:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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) [2025-03-17 19:52:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2025-03-17 19:52:06,539 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 38 transitions. [2025-03-17 19:52:06,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:06,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:52:06,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:52:06,541 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-03-17 19:52:06,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:06,608 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2025-03-17 19:52:06,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2025-03-17 19:52:06,610 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-03-17 19:52:06,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 35 transitions. [2025-03-17 19:52:06,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-17 19:52:06,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-17 19:52:06,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2025-03-17 19:52:06,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:52:06,613 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-03-17 19:52:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2025-03-17 19:52:06,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-03-17 19:52:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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) [2025-03-17 19:52:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2025-03-17 19:52:06,617 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 33 transitions. [2025-03-17 19:52:06,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:52:06,617 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2025-03-17 19:52:06,618 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:52:06,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2025-03-17 19:52:06,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-03-17 19:52:06,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:06,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:06,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:52:06,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:06,619 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" [2025-03-17 19:52:06,619 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-17 19:52:06,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:06,620 INFO L85 PathProgramCache]: Analyzing trace with hash 67488, now seen corresponding path program 2 times [2025-03-17 19:52:06,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:06,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590048098] [2025-03-17 19:52:06,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:06,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:06,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:06,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:06,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:06,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:06,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:06,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:06,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:06,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:06,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:06,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:06,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:06,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1959898203, now seen corresponding path program 1 times [2025-03-17 19:52:06,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:06,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212004690] [2025-03-17 19:52:06,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:06,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:06,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 19:52:06,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 19:52:06,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:06,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:06,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [961399041] [2025-03-17 19:52:06,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:06,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:06,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:06,668 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) [2025-03-17 19:52:06,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 19:52:06,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 19:52:06,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 19:52:06,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:06,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:06,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:06,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 19:52:06,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 19:52:06,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:06,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:06,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:06,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:06,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2115084986, now seen corresponding path program 1 times [2025-03-17 19:52:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:06,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085066924] [2025-03-17 19:52:06,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:06,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:06,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 19:52:06,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:52:06,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:06,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:06,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [704227057] [2025-03-17 19:52:06,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:06,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:06,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:06,757 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:06,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 19:52:06,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 19:52:06,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:52:06,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:06,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:06,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:06,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 19:52:06,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:52:06,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:06,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:06,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:06,910 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 [2025-03-17 19:52:07,111 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:07,111 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:07,111 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:07,111 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:07,111 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:07,111 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:07,111 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:07,112 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:07,112 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2025-03-17 19:52:07,112 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:07,112 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:07,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,192 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:07,193 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:07,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:07,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:07,195 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) [2025-03-17 19:52:07,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:07,203 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:07,207 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 [2025-03-17 19:52:07,220 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:07,220 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: [] [2025-03-17 19:52:07,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-17 19:52:07,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:07,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:07,231 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) [2025-03-17 19:52:07,234 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 [2025-03-17 19:52:07,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:07,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:07,250 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:07,251 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: [] [2025-03-17 19:52:07,257 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 [2025-03-17 19:52:07,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:07,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:07,260 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) [2025-03-17 19:52:07,260 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 [2025-03-17 19:52:07,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:07,261 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:07,273 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:07,273 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: [] [2025-03-17 19:52:07,279 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 [2025-03-17 19:52:07,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:07,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:07,281 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) [2025-03-17 19:52:07,282 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 [2025-03-17 19:52:07,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:07,283 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:07,299 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 [2025-03-17 19:52:07,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:07,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:07,301 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) [2025-03-17 19:52:07,302 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 [2025-03-17 19:52:07,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:07,305 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:07,318 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:07,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 19:52:07,325 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:07,325 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:07,325 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:07,325 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:07,325 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:07,325 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:07,325 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:07,325 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:07,325 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2025-03-17 19:52:07,325 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:07,325 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:07,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:07,414 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:07,414 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:07,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:07,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:07,418 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) [2025-03-17 19:52:07,419 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 [2025-03-17 19:52:07,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:07,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:07,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:07,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:07,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:07,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:07,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:07,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:07,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:07,438 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 [2025-03-17 19:52:07,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:07,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:07,440 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) [2025-03-17 19:52:07,442 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 [2025-03-17 19:52:07,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:07,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:07,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:07,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:07,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:07,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:07,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:07,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:07,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:07,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:07,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:07,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:07,462 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) [2025-03-17 19:52:07,463 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 [2025-03-17 19:52:07,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:07,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:07,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:07,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:07,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:07,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:07,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:07,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:07,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:07,485 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 [2025-03-17 19:52:07,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:07,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:07,487 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) [2025-03-17 19:52:07,488 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 [2025-03-17 19:52:07,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:07,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:07,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:07,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:07,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:07,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:07,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:07,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:07,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:07,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 19:52:07,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:07,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:07,510 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) [2025-03-17 19:52:07,511 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 [2025-03-17 19:52:07,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:07,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:07,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:07,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:07,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:07,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:07,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:07,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:07,525 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:07,527 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:07,527 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:07,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:07,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:07,529 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) [2025-03-17 19:52:07,530 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 [2025-03-17 19:52:07,531 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:07,531 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:07,531 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:07,531 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 [] [2025-03-17 19:52:07,537 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 [2025-03-17 19:52:07,538 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:07,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:07,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:07,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:07,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:07,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:07,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:07,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:07,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 19:52:07,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 19:52:07,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:07,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:07,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:52:07,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:52:07,744 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 [2025-03-17 19:52:07,744 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 11 Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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) [2025-03-17 19:52:07,976 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 11. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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 110 states and 173 transitions. Complement of second has 28 states. [2025-03-17 19:52:07,977 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 [2025-03-17 19:52:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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) [2025-03-17 19:52:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2025-03-17 19:52:07,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 3 letters. Loop has 22 letters. [2025-03-17 19:52:07,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:07,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 25 letters. Loop has 22 letters. [2025-03-17 19:52:07,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:07,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 3 letters. Loop has 44 letters. [2025-03-17 19:52:07,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:07,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 173 transitions. [2025-03-17 19:52:07,983 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2025-03-17 19:52:07,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 110 states and 173 transitions. [2025-03-17 19:52:07,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2025-03-17 19:52:07,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2025-03-17 19:52:07,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 173 transitions. [2025-03-17 19:52:07,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:07,987 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 173 transitions. [2025-03-17 19:52:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 173 transitions. [2025-03-17 19:52:07,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2025-03-17 19:52:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 30 states have call successors, (30), 6 states have call predecessors, (30), 8 states have return successors, (42), 30 states have call predecessors, (42), 30 states have call successors, (42) [2025-03-17 19:52:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2025-03-17 19:52:07,999 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 150 transitions. [2025-03-17 19:52:07,999 INFO L432 stractBuchiCegarLoop]: Abstraction has 101 states and 150 transitions. [2025-03-17 19:52:07,999 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:52:07,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 150 transitions. [2025-03-17 19:52:08,000 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2025-03-17 19:52:08,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:08,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:08,001 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:52:08,001 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] [2025-03-17 19:52:08,001 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-17 19:52:08,001 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-17 19:52:08,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:08,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2092155, now seen corresponding path program 1 times [2025-03-17 19:52:08,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:08,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336170532] [2025-03-17 19:52:08,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:08,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:08,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:08,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:08,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:08,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:08,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:08,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:08,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:08,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:08,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:08,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:08,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:08,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1270415285, now seen corresponding path program 1 times [2025-03-17 19:52:08,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:08,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943777821] [2025-03-17 19:52:08,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:08,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-17 19:52:08,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:08,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:52:08,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:52:08,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:08,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:52:08,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:08,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943777821] [2025-03-17 19:52:08,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943777821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:08,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:08,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:52:08,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55345288] [2025-03-17 19:52:08,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:08,114 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:08,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:08,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:52:08,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:52:08,114 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. cyclomatic complexity: 54 Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2025-03-17 19:52:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:08,169 INFO L93 Difference]: Finished difference Result 140 states and 211 transitions. [2025-03-17 19:52:08,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 211 transitions. [2025-03-17 19:52:08,172 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 49 [2025-03-17 19:52:08,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 137 states and 208 transitions. [2025-03-17 19:52:08,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2025-03-17 19:52:08,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2025-03-17 19:52:08,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 208 transitions. [2025-03-17 19:52:08,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:08,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 208 transitions. [2025-03-17 19:52:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 208 transitions. [2025-03-17 19:52:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2025-03-17 19:52:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 68 states have internal predecessors, (82), 30 states have call successors, (30), 6 states have call predecessors, (30), 8 states have return successors, (42), 30 states have call predecessors, (42), 30 states have call successors, (42) [2025-03-17 19:52:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2025-03-17 19:52:08,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 105 states and 154 transitions. [2025-03-17 19:52:08,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:52:08,186 INFO L432 stractBuchiCegarLoop]: Abstraction has 105 states and 154 transitions. [2025-03-17 19:52:08,187 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:52:08,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 154 transitions. [2025-03-17 19:52:08,194 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2025-03-17 19:52:08,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:08,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:08,195 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:52:08,195 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:08,195 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-17 19:52:08,195 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-17 19:52:08,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2092155, now seen corresponding path program 2 times [2025-03-17 19:52:08,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:08,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4296161] [2025-03-17 19:52:08,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:08,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:08,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:08,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:08,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:08,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:08,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:08,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:08,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:08,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:08,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:08,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:08,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash 977782072, now seen corresponding path program 1 times [2025-03-17 19:52:08,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:08,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348234806] [2025-03-17 19:52:08,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:08,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:08,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 19:52:08,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 19:52:08,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:08,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 19:52:08,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:08,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348234806] [2025-03-17 19:52:08,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348234806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:08,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484024056] [2025-03-17 19:52:08,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:08,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:08,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:08,517 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:08,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 19:52:08,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 19:52:08,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 19:52:08,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:08,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:08,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:52:08,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:52:08,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 36 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 19:52:08,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484024056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:08,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:08,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 10] total 19 [2025-03-17 19:52:08,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657397000] [2025-03-17 19:52:08,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:08,917 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:08,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:08,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:52:08,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-17 19:52:08,919 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. cyclomatic complexity: 54 Second operand has 19 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (13), 10 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-17 19:52:09,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:09,246 INFO L93 Difference]: Finished difference Result 227 states and 370 transitions. [2025-03-17 19:52:09,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 370 transitions. [2025-03-17 19:52:09,250 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 76 [2025-03-17 19:52:09,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 227 states and 370 transitions. [2025-03-17 19:52:09,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2025-03-17 19:52:09,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2025-03-17 19:52:09,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 370 transitions. [2025-03-17 19:52:09,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:09,255 INFO L218 hiAutomatonCegarLoop]: Abstraction has 227 states and 370 transitions. [2025-03-17 19:52:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 370 transitions. [2025-03-17 19:52:09,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 149. [2025-03-17 19:52:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 88 states have internal predecessors, (102), 46 states have call successors, (46), 10 states have call predecessors, (46), 16 states have return successors, (116), 50 states have call predecessors, (116), 46 states have call successors, (116) [2025-03-17 19:52:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 264 transitions. [2025-03-17 19:52:09,273 INFO L240 hiAutomatonCegarLoop]: Abstraction has 149 states and 264 transitions. [2025-03-17 19:52:09,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 19:52:09,274 INFO L432 stractBuchiCegarLoop]: Abstraction has 149 states and 264 transitions. [2025-03-17 19:52:09,274 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:52:09,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 264 transitions. [2025-03-17 19:52:09,275 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2025-03-17 19:52:09,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:09,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:09,276 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:52:09,276 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:09,277 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-17 19:52:09,277 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-17 19:52:09,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:09,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2092155, now seen corresponding path program 3 times [2025-03-17 19:52:09,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:09,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802203745] [2025-03-17 19:52:09,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:09,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:09,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:09,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:09,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:52:09,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:09,284 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:09,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:09,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:09,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:09,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:09,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:09,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:09,286 INFO L85 PathProgramCache]: Analyzing trace with hash 718698580, now seen corresponding path program 2 times [2025-03-17 19:52:09,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:09,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657358553] [2025-03-17 19:52:09,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:09,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:09,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-17 19:52:09,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 19:52:09,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:09,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 15 proven. 106 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-17 19:52:09,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:09,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657358553] [2025-03-17 19:52:09,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657358553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:09,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353242083] [2025-03-17 19:52:09,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:09,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:09,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:09,488 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) [2025-03-17 19:52:09,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-17 19:52:09,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-17 19:52:09,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 19:52:09,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:09,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:09,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 19:52:09,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 15 proven. 103 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-17 19:52:09,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 19:52:10,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353242083] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:10,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:10,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 19 [2025-03-17 19:52:10,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733472588] [2025-03-17 19:52:10,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:10,009 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:10,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:10,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:52:10,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-03-17 19:52:10,009 INFO L87 Difference]: Start difference. First operand 149 states and 264 transitions. cyclomatic complexity: 120 Second operand has 19 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 11 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2025-03-17 19:52:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:10,317 INFO L93 Difference]: Finished difference Result 285 states and 516 transitions. [2025-03-17 19:52:10,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 516 transitions. [2025-03-17 19:52:10,320 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 88 [2025-03-17 19:52:10,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 516 transitions. [2025-03-17 19:52:10,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2025-03-17 19:52:10,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2025-03-17 19:52:10,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 516 transitions. [2025-03-17 19:52:10,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:10,325 INFO L218 hiAutomatonCegarLoop]: Abstraction has 285 states and 516 transitions. [2025-03-17 19:52:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 516 transitions. [2025-03-17 19:52:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 175. [2025-03-17 19:52:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 99 states have (on average 1.1515151515151516) internal successors, (114), 100 states have internal predecessors, (114), 54 states have call successors, (54), 10 states have call predecessors, (54), 22 states have return successors, (186), 64 states have call predecessors, (186), 54 states have call successors, (186) [2025-03-17 19:52:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 354 transitions. [2025-03-17 19:52:10,339 INFO L240 hiAutomatonCegarLoop]: Abstraction has 175 states and 354 transitions. [2025-03-17 19:52:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 19:52:10,344 INFO L432 stractBuchiCegarLoop]: Abstraction has 175 states and 354 transitions. [2025-03-17 19:52:10,344 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:52:10,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 354 transitions. [2025-03-17 19:52:10,346 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2025-03-17 19:52:10,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:10,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:10,346 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:52:10,346 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:10,346 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-17 19:52:10,346 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-17 19:52:10,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:10,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2092155, now seen corresponding path program 4 times [2025-03-17 19:52:10,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:10,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556626330] [2025-03-17 19:52:10,347 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:10,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:10,350 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-03-17 19:52:10,351 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:10,351 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:10,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:10,351 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:10,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:10,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:10,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:10,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:10,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:10,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:10,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2052929324, now seen corresponding path program 3 times [2025-03-17 19:52:10,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:10,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396012816] [2025-03-17 19:52:10,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:10,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:10,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 7 equivalence classes. [2025-03-17 19:52:10,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:52:10,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 19:52:10,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 18 proven. 52 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 19:52:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:10,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396012816] [2025-03-17 19:52:10,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396012816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:10,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376844462] [2025-03-17 19:52:10,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:10,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:10,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:10,520 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) [2025-03-17 19:52:10,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-17 19:52:10,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 7 equivalence classes. [2025-03-17 19:52:10,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:52:10,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 19:52:10,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:10,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 19:52:10,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 39 proven. 37 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 19:52:10,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:52:10,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376844462] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:10,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:10,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 22 [2025-03-17 19:52:10,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672045732] [2025-03-17 19:52:10,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:10,964 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:10,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:10,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 19:52:10,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-03-17 19:52:10,965 INFO L87 Difference]: Start difference. First operand 175 states and 354 transitions. cyclomatic complexity: 184 Second operand has 22 states, 16 states have (on average 2.5625) internal successors, (41), 18 states have internal predecessors, (41), 14 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (16), 9 states have call predecessors, (16), 14 states have call successors, (16) [2025-03-17 19:52:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:11,316 INFO L93 Difference]: Finished difference Result 229 states and 444 transitions. [2025-03-17 19:52:11,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229 states and 444 transitions. [2025-03-17 19:52:11,318 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 60 [2025-03-17 19:52:11,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229 states to 229 states and 444 transitions. [2025-03-17 19:52:11,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-03-17 19:52:11,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2025-03-17 19:52:11,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 229 states and 444 transitions. [2025-03-17 19:52:11,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:11,325 INFO L218 hiAutomatonCegarLoop]: Abstraction has 229 states and 444 transitions. [2025-03-17 19:52:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states and 444 transitions. [2025-03-17 19:52:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 191. [2025-03-17 19:52:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 110 states have internal predecessors, (130), 58 states have call successors, (58), 16 states have call predecessors, (58), 22 states have return successors, (174), 64 states have call predecessors, (174), 58 states have call successors, (174) [2025-03-17 19:52:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 362 transitions. [2025-03-17 19:52:11,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 191 states and 362 transitions. [2025-03-17 19:52:11,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 19:52:11,340 INFO L432 stractBuchiCegarLoop]: Abstraction has 191 states and 362 transitions. [2025-03-17 19:52:11,341 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:52:11,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 362 transitions. [2025-03-17 19:52:11,342 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2025-03-17 19:52:11,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:11,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:11,342 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:52:11,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:11,342 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-17 19:52:11,342 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-17 19:52:11,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:11,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2092155, now seen corresponding path program 5 times [2025-03-17 19:52:11,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:11,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644721012] [2025-03-17 19:52:11,343 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:11,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:11,345 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:11,345 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:11,346 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:11,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:11,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:11,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:11,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:11,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:11,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:11,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:11,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2028255452, now seen corresponding path program 4 times [2025-03-17 19:52:11,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:11,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135507116] [2025-03-17 19:52:11,347 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:11,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:11,353 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-17 19:52:11,359 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 19:52:11,360 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:11,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:11,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880788667] [2025-03-17 19:52:11,360 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:11,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:11,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,362 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:11,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-17 19:52:11,394 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-17 19:52:11,403 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 19:52:11,403 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:11,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:11,404 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:11,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 19:52:11,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 19:52:11,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:11,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:11,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:11,417 INFO L85 PathProgramCache]: Analyzing trace with hash 388250966, now seen corresponding path program 1 times [2025-03-17 19:52:11,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:11,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827685557] [2025-03-17 19:52:11,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:11,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:11,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 19:52:11,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:52:11,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:11,479 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:52:11,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:11,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827685557] [2025-03-17 19:52:11,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827685557] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:11,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685243269] [2025-03-17 19:52:11,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:11,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:11,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,482 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:11,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-17 19:52:11,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 19:52:11,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:52:11,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:11,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:11,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 19:52:11,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:52:11,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685243269] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:11,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:11,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2025-03-17 19:52:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818645290] [2025-03-17 19:52:11,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:11,804 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:11,804 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:11,804 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:11,804 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:11,804 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:11,804 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,804 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:11,804 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:11,804 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2025-03-17 19:52:11,804 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:11,804 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:11,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,862 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:11,862 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:11,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,866 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) [2025-03-17 19:52:11,868 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 [2025-03-17 19:52:11,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:11,869 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:11,881 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:11,881 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: [] [2025-03-17 19:52:11,887 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 [2025-03-17 19:52:11,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,890 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) [2025-03-17 19:52:11,891 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 [2025-03-17 19:52:11,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:11,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:11,904 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:11,904 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: [] [2025-03-17 19:52:11,910 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 [2025-03-17 19:52:11,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,912 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) [2025-03-17 19:52:11,914 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 [2025-03-17 19:52:11,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:11,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:11,926 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:11,927 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: [] [2025-03-17 19:52:11,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:11,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,935 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) [2025-03-17 19:52:11,936 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 [2025-03-17 19:52:11,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:11,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:11,949 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:11,949 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: [] [2025-03-17 19:52:11,954 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 [2025-03-17 19:52:11,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,958 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) [2025-03-17 19:52:11,958 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 [2025-03-17 19:52:11,961 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:11,961 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:11,972 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:11,972 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: [] [2025-03-17 19:52:11,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:11,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,980 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) [2025-03-17 19:52:11,982 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 [2025-03-17 19:52:11,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:11,984 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:12,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 19:52:12,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:12,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,003 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) [2025-03-17 19:52:12,004 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 [2025-03-17 19:52:12,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:12,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:12,022 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:12,030 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 [2025-03-17 19:52:12,031 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:12,031 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:12,031 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:12,031 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:12,031 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:12,031 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:12,031 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:12,031 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:12,031 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2025-03-17 19:52:12,031 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:12,031 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:12,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,089 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:12,090 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:12,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:12,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,093 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) [2025-03-17 19:52:12,094 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 [2025-03-17 19:52:12,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:12,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:12,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:12,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:12,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:12,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:12,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:12,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:12,108 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:12,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-17 19:52:12,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:12,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,116 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) [2025-03-17 19:52:12,117 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 [2025-03-17 19:52:12,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:12,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:12,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:12,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:12,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:12,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:12,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:12,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:12,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:12,138 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 [2025-03-17 19:52:12,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:12,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,140 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) [2025-03-17 19:52:12,142 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 [2025-03-17 19:52:12,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:12,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:12,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:12,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:12,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:12,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:12,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:12,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:12,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:12,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-17 19:52:12,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:12,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,166 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) [2025-03-17 19:52:12,167 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 [2025-03-17 19:52:12,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:12,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:12,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:12,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:12,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:12,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:12,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:12,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:12,180 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:12,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-17 19:52:12,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:12,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,188 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) [2025-03-17 19:52:12,189 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 [2025-03-17 19:52:12,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:12,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:12,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:12,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:12,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:12,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:12,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:12,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:12,202 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:12,208 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 [2025-03-17 19:52:12,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:12,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,210 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:12,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-17 19:52:12,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:12,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:12,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:12,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:12,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:12,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:12,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:12,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:12,227 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:12,229 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:12,229 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:12,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:12,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,232 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:12,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-17 19:52:12,234 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:12,234 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:12,234 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:12,234 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 [] [2025-03-17 19:52:12,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:12,242 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:12,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:12,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:12,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:12,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:12,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:12,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:12,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:12,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 19:52:12,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 19:52:12,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:12,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:12,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:52:12,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 19:52:12,401 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 [2025-03-17 19:52:12,401 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 191 states and 362 transitions. cyclomatic complexity: 176 Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 19:52:12,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-17 19:52:12,582 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 191 states and 362 transitions. cyclomatic complexity: 176. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 862 states and 1419 transitions. Complement of second has 35 states. [2025-03-17 19:52:12,582 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 [2025-03-17 19:52:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 19:52:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2025-03-17 19:52:12,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 4 letters. Loop has 32 letters. [2025-03-17 19:52:12,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:12,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 36 letters. Loop has 32 letters. [2025-03-17 19:52:12,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:12,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 4 letters. Loop has 64 letters. [2025-03-17 19:52:12,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:12,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 862 states and 1419 transitions. [2025-03-17 19:52:12,596 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 87 [2025-03-17 19:52:12,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 862 states to 798 states and 1337 transitions. [2025-03-17 19:52:12,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2025-03-17 19:52:12,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 236 [2025-03-17 19:52:12,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 798 states and 1337 transitions. [2025-03-17 19:52:12,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:12,611 INFO L218 hiAutomatonCegarLoop]: Abstraction has 798 states and 1337 transitions. [2025-03-17 19:52:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states and 1337 transitions. [2025-03-17 19:52:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 754. [2025-03-17 19:52:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 452 states have (on average 1.165929203539823) internal successors, (527), 447 states have internal predecessors, (527), 200 states have call successors, (200), 77 states have call predecessors, (200), 102 states have return successors, (564), 229 states have call predecessors, (564), 198 states have call successors, (564) [2025-03-17 19:52:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1291 transitions. [2025-03-17 19:52:12,642 INFO L240 hiAutomatonCegarLoop]: Abstraction has 754 states and 1291 transitions. [2025-03-17 19:52:12,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:12,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 19:52:12,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:52:12,643 INFO L87 Difference]: Start difference. First operand 754 states and 1291 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 19:52:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:12,733 INFO L93 Difference]: Finished difference Result 673 states and 1066 transitions. [2025-03-17 19:52:12,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 673 states and 1066 transitions. [2025-03-17 19:52:12,739 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 74 [2025-03-17 19:52:12,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 673 states to 607 states and 990 transitions. [2025-03-17 19:52:12,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2025-03-17 19:52:12,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2025-03-17 19:52:12,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 607 states and 990 transitions. [2025-03-17 19:52:12,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:12,746 INFO L218 hiAutomatonCegarLoop]: Abstraction has 607 states and 990 transitions. [2025-03-17 19:52:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states and 990 transitions. [2025-03-17 19:52:12,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 595. [2025-03-17 19:52:12,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 363 states have (on average 1.1707988980716253) internal successors, (425), 363 states have internal predecessors, (425), 152 states have call successors, (152), 64 states have call predecessors, (152), 80 states have return successors, (401), 167 states have call predecessors, (401), 150 states have call successors, (401) [2025-03-17 19:52:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 978 transitions. [2025-03-17 19:52:12,762 INFO L240 hiAutomatonCegarLoop]: Abstraction has 595 states and 978 transitions. [2025-03-17 19:52:12,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:52:12,763 INFO L432 stractBuchiCegarLoop]: Abstraction has 595 states and 978 transitions. [2025-03-17 19:52:12,763 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 19:52:12,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 595 states and 978 transitions. [2025-03-17 19:52:12,766 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 74 [2025-03-17 19:52:12,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:12,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:12,767 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 19:52:12,767 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:12,767 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:12,767 INFO L754 eck$LassoCheckResult]: Loop: "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:12,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash 64856831, now seen corresponding path program 1 times [2025-03-17 19:52:12,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:12,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941958864] [2025-03-17 19:52:12,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:12,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:12,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:12,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:12,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:12,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:12,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:12,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:12,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:12,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:12,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:12,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:12,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:12,772 INFO L85 PathProgramCache]: Analyzing trace with hash 395823698, now seen corresponding path program 1 times [2025-03-17 19:52:12,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:12,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028608973] [2025-03-17 19:52:12,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:12,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:12,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 19:52:12,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 19:52:12,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:12,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 19:52:12,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:12,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028608973] [2025-03-17 19:52:12,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028608973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:12,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091634601] [2025-03-17 19:52:12,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:12,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:12,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,871 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) [2025-03-17 19:52:12,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-03-17 19:52:12,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 19:52:12,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 19:52:12,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:12,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:12,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 19:52:12,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:52:12,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 19:52:13,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091634601] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:13,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:13,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 17 [2025-03-17 19:52:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167400120] [2025-03-17 19:52:13,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:13,127 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:13,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:13,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 19:52:13,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-17 19:52:13,127 INFO L87 Difference]: Start difference. First operand 595 states and 978 transitions. cyclomatic complexity: 400 Second operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 10 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-17 19:52:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:13,318 INFO L93 Difference]: Finished difference Result 705 states and 1076 transitions. [2025-03-17 19:52:13,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 705 states and 1076 transitions. [2025-03-17 19:52:13,325 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 96 [2025-03-17 19:52:13,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 705 states to 669 states and 1028 transitions. [2025-03-17 19:52:13,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 224 [2025-03-17 19:52:13,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2025-03-17 19:52:13,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 669 states and 1028 transitions. [2025-03-17 19:52:13,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:13,333 INFO L218 hiAutomatonCegarLoop]: Abstraction has 669 states and 1028 transitions. [2025-03-17 19:52:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states and 1028 transitions. [2025-03-17 19:52:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 583. [2025-03-17 19:52:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 371 states have (on average 1.1455525606469004) internal successors, (425), 359 states have internal predecessors, (425), 132 states have call successors, (132), 68 states have call predecessors, (132), 80 states have return successors, (333), 155 states have call predecessors, (333), 130 states have call successors, (333) [2025-03-17 19:52:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 890 transitions. [2025-03-17 19:52:13,352 INFO L240 hiAutomatonCegarLoop]: Abstraction has 583 states and 890 transitions. [2025-03-17 19:52:13,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:52:13,353 INFO L432 stractBuchiCegarLoop]: Abstraction has 583 states and 890 transitions. [2025-03-17 19:52:13,353 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 19:52:13,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 583 states and 890 transitions. [2025-03-17 19:52:13,355 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 70 [2025-03-17 19:52:13,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:13,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:13,356 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 19:52:13,356 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:13,356 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:13,356 INFO L754 eck$LassoCheckResult]: Loop: "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:13,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:13,357 INFO L85 PathProgramCache]: Analyzing trace with hash 64856831, now seen corresponding path program 2 times [2025-03-17 19:52:13,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:13,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433380665] [2025-03-17 19:52:13,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:13,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:13,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:13,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:13,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:13,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:13,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:13,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:13,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:13,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:13,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:13,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:13,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:13,365 INFO L85 PathProgramCache]: Analyzing trace with hash 781279890, now seen corresponding path program 2 times [2025-03-17 19:52:13,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:13,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285660596] [2025-03-17 19:52:13,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:13,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-17 19:52:13,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:52:13,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:13,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:13,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406425247] [2025-03-17 19:52:13,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:13,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:13,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:13,379 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) [2025-03-17 19:52:13,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-03-17 19:52:13,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-17 19:52:13,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:52:13,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:13,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:13,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:13,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 19:52:13,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:52:13,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:13,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:13,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:13,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1048248176, now seen corresponding path program 1 times [2025-03-17 19:52:13,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:13,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684680378] [2025-03-17 19:52:13,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:13,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:13,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 19:52:13,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 19:52:13,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:13,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-17 19:52:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684680378] [2025-03-17 19:52:13,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684680378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:13,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:13,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:52:13,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58120721] [2025-03-17 19:52:13,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:13,730 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:13,730 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:13,730 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:13,730 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:13,730 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:13,730 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:13,730 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:13,730 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:13,730 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration9_Loop [2025-03-17 19:52:13,730 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:13,730 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:13,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,800 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:13,800 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:13,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:13,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:13,805 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:13,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-17 19:52:13,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:13,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:13,820 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:13,820 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: [] [2025-03-17 19:52:13,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:13,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:13,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:13,829 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:13,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-17 19:52:13,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:13,832 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:13,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-17 19:52:13,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:13,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:13,885 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) [2025-03-17 19:52:13,886 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 [2025-03-17 19:52:13,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:13,887 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:13,899 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:13,906 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 [2025-03-17 19:52:13,906 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:13,906 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:13,906 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:13,906 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:13,906 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:13,906 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:13,906 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:13,906 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:13,906 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration9_Loop [2025-03-17 19:52:13,906 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:13,906 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:13,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:13,982 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:13,983 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:13,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:13,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:13,985 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) [2025-03-17 19:52:13,987 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 [2025-03-17 19:52:13,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:14,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:14,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:14,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:14,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:14,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:14,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:14,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:14,002 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:14,009 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 [2025-03-17 19:52:14,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:14,012 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) [2025-03-17 19:52:14,013 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 [2025-03-17 19:52:14,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:14,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:14,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:14,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:14,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:14,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:14,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:14,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:14,026 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:14,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-17 19:52:14,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:14,036 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) [2025-03-17 19:52:14,037 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 [2025-03-17 19:52:14,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:14,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:14,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:14,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:14,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:14,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:14,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:14,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:14,050 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:14,051 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:14,051 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:14,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:14,055 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) [2025-03-17 19:52:14,056 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 [2025-03-17 19:52:14,056 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:14,057 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:14,057 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:14,057 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 [] [2025-03-17 19:52:14,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-17 19:52:14,063 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:14,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:14,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:14,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:14,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:14,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:14,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:14,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:14,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 19:52:14,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:52:14,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:14,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:14,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 19:52:14,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-17 19:52:14,265 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2025-03-17 19:52:14,266 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 583 states and 890 transitions. cyclomatic complexity: 324 Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 19:52:14,499 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 583 states and 890 transitions. cyclomatic complexity: 324. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 1390 states and 1947 transitions. Complement of second has 53 states. [2025-03-17 19:52:14,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 19:52:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2025-03-17 19:52:14,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 65 transitions. Stem has 5 letters. Loop has 44 letters. [2025-03-17 19:52:14,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:14,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 65 transitions. Stem has 49 letters. Loop has 44 letters. [2025-03-17 19:52:14,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:14,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 65 transitions. Stem has 5 letters. Loop has 88 letters. [2025-03-17 19:52:14,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:14,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1390 states and 1947 transitions. [2025-03-17 19:52:14,513 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 61 [2025-03-17 19:52:14,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1390 states to 973 states and 1394 transitions. [2025-03-17 19:52:14,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2025-03-17 19:52:14,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 218 [2025-03-17 19:52:14,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 973 states and 1394 transitions. [2025-03-17 19:52:14,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:14,521 INFO L218 hiAutomatonCegarLoop]: Abstraction has 973 states and 1394 transitions. [2025-03-17 19:52:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states and 1394 transitions. [2025-03-17 19:52:14,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 761. [2025-03-17 19:52:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 495 states have (on average 1.1616161616161615) internal successors, (575), 480 states have internal predecessors, (575), 152 states have call successors, (152), 88 states have call predecessors, (152), 114 states have return successors, (382), 192 states have call predecessors, (382), 149 states have call successors, (382) [2025-03-17 19:52:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1109 transitions. [2025-03-17 19:52:14,539 INFO L240 hiAutomatonCegarLoop]: Abstraction has 761 states and 1109 transitions. [2025-03-17 19:52:14,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:14,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:52:14,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:52:14,539 INFO L87 Difference]: Start difference. First operand 761 states and 1109 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2025-03-17 19:52:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:14,569 INFO L93 Difference]: Finished difference Result 634 states and 917 transitions. [2025-03-17 19:52:14,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 634 states and 917 transitions. [2025-03-17 19:52:14,573 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 56 [2025-03-17 19:52:14,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 634 states to 634 states and 917 transitions. [2025-03-17 19:52:14,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2025-03-17 19:52:14,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2025-03-17 19:52:14,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 634 states and 917 transitions. [2025-03-17 19:52:14,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:14,577 INFO L218 hiAutomatonCegarLoop]: Abstraction has 634 states and 917 transitions. [2025-03-17 19:52:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states and 917 transitions. [2025-03-17 19:52:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 630. [2025-03-17 19:52:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 409 states have (on average 1.1491442542787287) internal successors, (470), 398 states have internal predecessors, (470), 128 states have call successors, (128), 74 states have call predecessors, (128), 93 states have return successors, (315), 157 states have call predecessors, (315), 125 states have call successors, (315) [2025-03-17 19:52:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 913 transitions. [2025-03-17 19:52:14,591 INFO L240 hiAutomatonCegarLoop]: Abstraction has 630 states and 913 transitions. [2025-03-17 19:52:14,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:52:14,592 INFO L432 stractBuchiCegarLoop]: Abstraction has 630 states and 913 transitions. [2025-03-17 19:52:14,592 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 19:52:14,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 630 states and 913 transitions. [2025-03-17 19:52:14,594 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 [2025-03-17 19:52:14,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:14,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:14,594 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:14,594 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:52:14,595 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< [2025-03-17 19:52:14,595 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< [2025-03-17 19:52:14,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash 58715277, now seen corresponding path program 1 times [2025-03-17 19:52:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:14,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350029925] [2025-03-17 19:52:14,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:14,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:14,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:14,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:14,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:14,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:14,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:14,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350029925] [2025-03-17 19:52:14,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350029925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:14,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:14,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:52:14,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562453458] [2025-03-17 19:52:14,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:14,623 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:14,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:14,623 INFO L85 PathProgramCache]: Analyzing trace with hash 33768, now seen corresponding path program 1 times [2025-03-17 19:52:14,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:14,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097973586] [2025-03-17 19:52:14,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:14,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:14,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:14,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:14,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:14,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:14,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:14,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:14,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:14,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:14,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:14,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:14,647 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:14,647 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:14,647 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:14,647 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:14,648 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:14,648 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,648 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:14,648 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:14,648 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2025-03-17 19:52:14,648 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:14,648 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:14,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:14,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:14,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:14,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:14,671 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:14,671 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:14,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:14,674 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) [2025-03-17 19:52:14,676 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 [2025-03-17 19:52:14,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:14,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:14,689 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:14,690 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:14,696 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 [2025-03-17 19:52:14,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:14,698 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) [2025-03-17 19:52:14,699 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 [2025-03-17 19:52:14,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:14,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:14,713 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:14,713 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:14,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:14,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:14,721 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) [2025-03-17 19:52:14,722 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 [2025-03-17 19:52:14,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:14,723 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:14,733 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:14,733 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:14,739 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 [2025-03-17 19:52:14,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:14,741 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) [2025-03-17 19:52:14,742 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 [2025-03-17 19:52:14,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:14,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:14,760 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 [2025-03-17 19:52:14,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:14,763 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) [2025-03-17 19:52:14,763 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 [2025-03-17 19:52:14,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:14,765 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:14,786 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:14,790 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 [2025-03-17 19:52:14,790 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:14,790 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:14,790 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:14,790 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:14,790 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:14,790 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,790 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:14,790 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:14,790 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2025-03-17 19:52:14,790 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:14,790 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:14,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:14,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:14,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:14,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:14,810 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:14,810 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:14,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:14,812 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:14,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-17 19:52:14,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:14,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:14,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:14,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:14,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:14,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:14,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:14,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:14,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:14,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-17 19:52:14,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:14,832 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) [2025-03-17 19:52:14,833 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 [2025-03-17 19:52:14,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:14,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:14,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:14,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:14,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:14,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:14,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:14,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:14,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:14,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-17 19:52:14,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:14,853 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) [2025-03-17 19:52:14,854 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 [2025-03-17 19:52:14,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:14,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:14,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:14,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:14,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:14,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:14,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:14,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:14,872 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:14,877 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 [2025-03-17 19:52:14,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:14,879 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) [2025-03-17 19:52:14,880 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 [2025-03-17 19:52:14,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:14,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:14,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:14,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:14,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:14,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:14,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:14,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:14,897 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:14,899 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 19:52:14,899 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:14,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:14,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:14,901 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) [2025-03-17 19:52:14,902 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 [2025-03-17 19:52:14,902 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:14,902 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:14,902 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:14,903 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2025-03-17 19:52:14,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-17 19:52:14,909 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:14,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:14,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:14,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:14,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:14,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:14,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:14,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:14,948 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 [2025-03-17 19:52:14,953 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 [2025-03-17 19:52:14,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:14,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:14,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:14,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:14,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:52:14,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:14,978 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 [2025-03-17 19:52:14,978 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 630 states and 913 transitions. cyclomatic complexity: 300 Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:15,013 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 630 states and 913 transitions. cyclomatic complexity: 300. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 915 states and 1328 transitions. Complement of second has 17 states. [2025-03-17 19:52:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2025-03-17 19:52:15,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-17 19:52:15,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:15,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-17 19:52:15,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:15,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 10 letters. Loop has 6 letters. [2025-03-17 19:52:15,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:15,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 915 states and 1328 transitions. [2025-03-17 19:52:15,023 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 [2025-03-17 19:52:15,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 915 states to 841 states and 1242 transitions. [2025-03-17 19:52:15,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2025-03-17 19:52:15,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2025-03-17 19:52:15,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 841 states and 1242 transitions. [2025-03-17 19:52:15,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:15,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 841 states and 1242 transitions. [2025-03-17 19:52:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states and 1242 transitions. [2025-03-17 19:52:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 827. [2025-03-17 19:52:15,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 532 states have (on average 1.163533834586466) internal successors, (619), 539 states have internal predecessors, (619), 175 states have call successors, (175), 114 states have call predecessors, (175), 120 states have return successors, (419), 173 states have call predecessors, (419), 172 states have call successors, (419) [2025-03-17 19:52:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1213 transitions. [2025-03-17 19:52:15,048 INFO L240 hiAutomatonCegarLoop]: Abstraction has 827 states and 1213 transitions. [2025-03-17 19:52:15,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:15,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:52:15,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:52:15,048 INFO L87 Difference]: Start difference. First operand 827 states and 1213 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:52:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:15,092 INFO L93 Difference]: Finished difference Result 827 states and 1212 transitions. [2025-03-17 19:52:15,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 827 states and 1212 transitions. [2025-03-17 19:52:15,097 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 [2025-03-17 19:52:15,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 827 states to 827 states and 1212 transitions. [2025-03-17 19:52:15,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2025-03-17 19:52:15,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2025-03-17 19:52:15,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 827 states and 1212 transitions. [2025-03-17 19:52:15,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:15,103 INFO L218 hiAutomatonCegarLoop]: Abstraction has 827 states and 1212 transitions. [2025-03-17 19:52:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states and 1212 transitions. [2025-03-17 19:52:15,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 827. [2025-03-17 19:52:15,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 532 states have (on average 1.1616541353383458) internal successors, (618), 539 states have internal predecessors, (618), 175 states have call successors, (175), 114 states have call predecessors, (175), 120 states have return successors, (419), 173 states have call predecessors, (419), 172 states have call successors, (419) [2025-03-17 19:52:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1212 transitions. [2025-03-17 19:52:15,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 827 states and 1212 transitions. [2025-03-17 19:52:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:52:15,119 INFO L432 stractBuchiCegarLoop]: Abstraction has 827 states and 1212 transitions. [2025-03-17 19:52:15,120 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 19:52:15,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 827 states and 1212 transitions. [2025-03-17 19:52:15,123 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 [2025-03-17 19:52:15,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:15,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:15,124 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:15,124 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:15,124 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:15,124 INFO L754 eck$LassoCheckResult]: Loop: "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:15,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:15,124 INFO L85 PathProgramCache]: Analyzing trace with hash -824478352, now seen corresponding path program 2 times [2025-03-17 19:52:15,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:15,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810243009] [2025-03-17 19:52:15,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:15,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:15,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-17 19:52:15,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:52:15,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:15,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:52:15,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:15,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810243009] [2025-03-17 19:52:15,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810243009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:15,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821627413] [2025-03-17 19:52:15,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:15,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:15,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,169 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-03-17 19:52:15,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-17 19:52:15,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:52:15,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:15,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:15,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:15,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:52:15,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:52:15,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821627413] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:15,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:15,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-03-17 19:52:15,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833034791] [2025-03-17 19:52:15,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:15,268 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:15,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:15,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1232081682, now seen corresponding path program 3 times [2025-03-17 19:52:15,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:15,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119742854] [2025-03-17 19:52:15,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:15,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:15,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 14 equivalence classes. [2025-03-17 19:52:15,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 65 of 74 statements. [2025-03-17 19:52:15,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 19:52:15,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 48 proven. 184 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-17 19:52:15,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:15,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119742854] [2025-03-17 19:52:15,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119742854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:15,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813897840] [2025-03-17 19:52:15,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:15,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:15,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,494 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) [2025-03-17 19:52:15,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-03-17 19:52:15,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 14 equivalence classes. [2025-03-17 19:52:15,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 65 of 74 statements. [2025-03-17 19:52:15,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 19:52:15,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:15,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 19:52:15,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 179 proven. 86 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-17 19:52:15,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 15 proven. 219 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-17 19:52:16,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813897840] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:16,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:16,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 18] total 25 [2025-03-17 19:52:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313660449] [2025-03-17 19:52:16,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:16,433 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:16,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:52:16,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:52:16,433 INFO L87 Difference]: Start difference. First operand 827 states and 1212 transitions. cyclomatic complexity: 410 Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 19:52:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:16,522 INFO L93 Difference]: Finished difference Result 879 states and 1306 transitions. [2025-03-17 19:52:16,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 879 states and 1306 transitions. [2025-03-17 19:52:16,528 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 63 [2025-03-17 19:52:16,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 879 states to 873 states and 1296 transitions. [2025-03-17 19:52:16,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 192 [2025-03-17 19:52:16,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2025-03-17 19:52:16,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 873 states and 1296 transitions. [2025-03-17 19:52:16,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:16,536 INFO L218 hiAutomatonCegarLoop]: Abstraction has 873 states and 1296 transitions. [2025-03-17 19:52:16,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states and 1296 transitions. [2025-03-17 19:52:16,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 841. [2025-03-17 19:52:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 532 states have (on average 1.1578947368421053) internal successors, (616), 545 states have internal predecessors, (616), 187 states have call successors, (187), 114 states have call predecessors, (187), 122 states have return successors, (439), 181 states have call predecessors, (439), 184 states have call successors, (439) [2025-03-17 19:52:16,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1242 transitions. [2025-03-17 19:52:16,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 841 states and 1242 transitions. [2025-03-17 19:52:16,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:52:16,559 INFO L432 stractBuchiCegarLoop]: Abstraction has 841 states and 1242 transitions. [2025-03-17 19:52:16,559 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 19:52:16,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 841 states and 1242 transitions. [2025-03-17 19:52:16,563 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 58 [2025-03-17 19:52:16,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:16,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:16,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:16,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:16,566 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:16,566 INFO L754 eck$LassoCheckResult]: Loop: "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:16,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2143810600, now seen corresponding path program 3 times [2025-03-17 19:52:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:16,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728347589] [2025-03-17 19:52:16,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:16,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:16,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 5 equivalence classes. [2025-03-17 19:52:16,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 26 of 31 statements. [2025-03-17 19:52:16,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 19:52:16,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:52:16,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:16,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728347589] [2025-03-17 19:52:16,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728347589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:16,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27759155] [2025-03-17 19:52:16,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:16,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:16,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:16,635 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:16,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-03-17 19:52:16,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 5 equivalence classes. [2025-03-17 19:52:16,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 26 of 31 statements. [2025-03-17 19:52:16,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 19:52:16,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:16,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:52:16,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:52:16,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:52:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27759155] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:16,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:16,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-17 19:52:16,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190073303] [2025-03-17 19:52:16,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:16,782 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:16,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:16,782 INFO L85 PathProgramCache]: Analyzing trace with hash -428193298, now seen corresponding path program 4 times [2025-03-17 19:52:16,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:16,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504279708] [2025-03-17 19:52:16,782 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:16,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:16,785 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-03-17 19:52:16,788 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:52:16,788 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:52:16,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-17 19:52:16,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:16,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504279708] [2025-03-17 19:52:16,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504279708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:16,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340767317] [2025-03-17 19:52:16,938 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:16,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:16,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:16,941 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:16,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-03-17 19:52:16,974 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-03-17 19:52:16,983 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:52:16,983 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:52:16,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:16,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 19:52:16,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 29 proven. 59 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-17 19:52:17,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 29 proven. 67 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 19:52:17,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340767317] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:17,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:17,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 14] total 23 [2025-03-17 19:52:17,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730545377] [2025-03-17 19:52:17,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:17,441 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:17,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:17,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:52:17,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 19:52:17,441 INFO L87 Difference]: Start difference. First operand 841 states and 1242 transitions. cyclomatic complexity: 426 Second operand has 11 states, 8 states have (on average 2.875) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 19:52:17,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:17,593 INFO L93 Difference]: Finished difference Result 885 states and 1350 transitions. [2025-03-17 19:52:17,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 885 states and 1350 transitions. [2025-03-17 19:52:17,598 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 80 [2025-03-17 19:52:17,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 885 states to 875 states and 1326 transitions. [2025-03-17 19:52:17,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 205 [2025-03-17 19:52:17,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 205 [2025-03-17 19:52:17,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 875 states and 1326 transitions. [2025-03-17 19:52:17,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:17,605 INFO L218 hiAutomatonCegarLoop]: Abstraction has 875 states and 1326 transitions. [2025-03-17 19:52:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states and 1326 transitions. [2025-03-17 19:52:17,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2025-03-17 19:52:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 548 states have (on average 1.1532846715328466) internal successors, (632), 557 states have internal predecessors, (632), 207 states have call successors, (207), 114 states have call predecessors, (207), 120 states have return successors, (487), 203 states have call predecessors, (487), 204 states have call successors, (487) [2025-03-17 19:52:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1326 transitions. [2025-03-17 19:52:17,623 INFO L240 hiAutomatonCegarLoop]: Abstraction has 875 states and 1326 transitions. [2025-03-17 19:52:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:52:17,624 INFO L432 stractBuchiCegarLoop]: Abstraction has 875 states and 1326 transitions. [2025-03-17 19:52:17,624 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 19:52:17,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 875 states and 1326 transitions. [2025-03-17 19:52:17,628 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 80 [2025-03-17 19:52:17,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:17,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:17,629 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 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] [2025-03-17 19:52:17,629 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:52:17,629 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< [2025-03-17 19:52:17,629 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< [2025-03-17 19:52:17,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:17,629 INFO L85 PathProgramCache]: Analyzing trace with hash 641131718, now seen corresponding path program 1 times [2025-03-17 19:52:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:17,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654664905] [2025-03-17 19:52:17,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:17,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:17,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 19:52:17,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:52:17,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:17,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:17,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101415974] [2025-03-17 19:52:17,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:17,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:17,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,639 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2025-03-17 19:52:17,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 19:52:17,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:52:17,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:17,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:17,692 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:17,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 19:52:17,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:52:17,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:17,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:17,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:17,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash 33768, now seen corresponding path program 2 times [2025-03-17 19:52:17,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:17,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918407956] [2025-03-17 19:52:17,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:17,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:17,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:17,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:17,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:17,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:17,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:17,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:17,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:17,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:17,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:17,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:17,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:17,716 INFO L85 PathProgramCache]: Analyzing trace with hash 235449603, now seen corresponding path program 2 times [2025-03-17 19:52:17,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:17,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666563597] [2025-03-17 19:52:17,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:17,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:17,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-17 19:52:17,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 19:52:17,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:17,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 19:52:17,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:17,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666563597] [2025-03-17 19:52:17,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666563597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:17,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970913255] [2025-03-17 19:52:17,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:17,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:17,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,802 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-03-17 19:52:17,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-17 19:52:17,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 19:52:17,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:17,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:17,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:52:17,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 19:52:17,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 19:52:17,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970913255] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:17,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:17,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2025-03-17 19:52:17,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520121637] [2025-03-17 19:52:17,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:17,988 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:17,988 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:17,988 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:17,988 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:17,988 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:17,988 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,988 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:17,988 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:17,989 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2025-03-17 19:52:17,989 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:17,989 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:17,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:18,005 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:18,005 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:18,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:18,007 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) [2025-03-17 19:52:18,008 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 [2025-03-17 19:52:18,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:18,009 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:18,020 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:18,020 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:18,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-17 19:52:18,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:18,027 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) [2025-03-17 19:52:18,028 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 [2025-03-17 19:52:18,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:18,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:18,039 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:18,040 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:18,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:18,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:18,047 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) [2025-03-17 19:52:18,048 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 [2025-03-17 19:52:18,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:18,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:18,065 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 [2025-03-17 19:52:18,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:18,067 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) [2025-03-17 19:52:18,068 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 [2025-03-17 19:52:18,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:18,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:18,090 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:18,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:18,094 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:18,094 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:18,094 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:18,094 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:18,094 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:18,094 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,094 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:18,094 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:18,094 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2025-03-17 19:52:18,094 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:18,094 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:18,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:18,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:18,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:18,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:18,115 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:18,115 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:18,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:18,117 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) [2025-03-17 19:52:18,118 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 [2025-03-17 19:52:18,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:18,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:18,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:18,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:18,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:18,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:18,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:18,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:18,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:18,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-17 19:52:18,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:18,137 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) [2025-03-17 19:52:18,149 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 [2025-03-17 19:52:18,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:18,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:18,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:18,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:18,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:18,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:18,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:18,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:18,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:18,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-17 19:52:18,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:18,168 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:18,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-17 19:52:18,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:18,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:18,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:18,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:18,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:18,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:18,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:18,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:18,182 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:18,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-17 19:52:18,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:18,190 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:18,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-17 19:52:18,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:18,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:18,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:18,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:18,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:18,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:18,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:18,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:18,205 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:18,209 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:18,209 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:18,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:18,211 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) [2025-03-17 19:52:18,212 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 [2025-03-17 19:52:18,213 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:18,213 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:18,213 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:18,214 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2025-03-17 19:52:18,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:18,220 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:18,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:18,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 19:52:18,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:52:18,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:18,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:18,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:52:18,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:18,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:18,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:18,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:18,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:18,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:52:18,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:18,445 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 [2025-03-17 19:52:18,446 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 875 states and 1326 transitions. cyclomatic complexity: 477 Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 19:52:18,512 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 875 states and 1326 transitions. cyclomatic complexity: 477. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Result 942 states and 1412 transitions. Complement of second has 17 states. [2025-03-17 19:52:18,512 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 [2025-03-17 19:52:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 19:52:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2025-03-17 19:52:18,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 46 letters. Loop has 3 letters. [2025-03-17 19:52:18,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:18,513 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:18,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:18,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 19:52:18,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:52:18,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:18,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:18,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:52:18,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:18,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:18,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:18,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:18,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:18,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:52:18,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:18,722 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 [2025-03-17 19:52:18,723 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 875 states and 1326 transitions. cyclomatic complexity: 477 Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 19:52:18,779 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 875 states and 1326 transitions. cyclomatic complexity: 477. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Result 942 states and 1412 transitions. Complement of second has 17 states. [2025-03-17 19:52:18,780 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 [2025-03-17 19:52:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 19:52:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2025-03-17 19:52:18,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 46 letters. Loop has 3 letters. [2025-03-17 19:52:18,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:18,780 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:18,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:18,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 19:52:18,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:52:18,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:18,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:18,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:52:18,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:18,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:18,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:18,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:18,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:18,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:52:18,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:18,986 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 [2025-03-17 19:52:18,987 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 875 states and 1326 transitions. cyclomatic complexity: 477 Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 19:52:19,022 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Exception during sending of exit command (exit): Broken pipe [2025-03-17 19:52:19,023 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 [2025-03-17 19:52:19,080 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 875 states and 1326 transitions. cyclomatic complexity: 477. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Result 1094 states and 1594 transitions. Complement of second has 19 states. [2025-03-17 19:52:19,085 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 [2025-03-17 19:52:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 19:52:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2025-03-17 19:52:19,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 46 letters. Loop has 3 letters. [2025-03-17 19:52:19,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:19,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 49 letters. Loop has 3 letters. [2025-03-17 19:52:19,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:19,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 46 letters. Loop has 6 letters. [2025-03-17 19:52:19,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:19,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1094 states and 1594 transitions. [2025-03-17 19:52:19,092 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 74 [2025-03-17 19:52:19,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1094 states to 909 states and 1387 transitions. [2025-03-17 19:52:19,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 171 [2025-03-17 19:52:19,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2025-03-17 19:52:19,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 909 states and 1387 transitions. [2025-03-17 19:52:19,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:19,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 909 states and 1387 transitions. [2025-03-17 19:52:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states and 1387 transitions. [2025-03-17 19:52:19,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 796. [2025-03-17 19:52:19,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 506 states have (on average 1.1561264822134387) internal successors, (585), 505 states have internal predecessors, (585), 178 states have call successors, (178), 98 states have call predecessors, (178), 112 states have return successors, (420), 192 states have call predecessors, (420), 178 states have call successors, (420) [2025-03-17 19:52:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1183 transitions. [2025-03-17 19:52:19,114 INFO L240 hiAutomatonCegarLoop]: Abstraction has 796 states and 1183 transitions. [2025-03-17 19:52:19,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:19,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 19:52:19,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:52:19,115 INFO L87 Difference]: Start difference. First operand 796 states and 1183 transitions. Second operand has 13 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-17 19:52:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:19,294 INFO L93 Difference]: Finished difference Result 1228 states and 1882 transitions. [2025-03-17 19:52:19,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1882 transitions. [2025-03-17 19:52:19,301 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 115 [2025-03-17 19:52:19,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1206 states and 1860 transitions. [2025-03-17 19:52:19,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 274 [2025-03-17 19:52:19,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 274 [2025-03-17 19:52:19,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1206 states and 1860 transitions. [2025-03-17 19:52:19,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:19,312 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1206 states and 1860 transitions. [2025-03-17 19:52:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states and 1860 transitions. [2025-03-17 19:52:19,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1058. [2025-03-17 19:52:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 660 states have (on average 1.1606060606060606) internal successors, (766), 671 states have internal predecessors, (766), 256 states have call successors, (256), 128 states have call predecessors, (256), 142 states have return successors, (578), 258 states have call predecessors, (578), 256 states have call successors, (578) [2025-03-17 19:52:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1600 transitions. [2025-03-17 19:52:19,343 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1058 states and 1600 transitions. [2025-03-17 19:52:19,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:52:19,345 INFO L432 stractBuchiCegarLoop]: Abstraction has 1058 states and 1600 transitions. [2025-03-17 19:52:19,345 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 19:52:19,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1058 states and 1600 transitions. [2025-03-17 19:52:19,348 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 95 [2025-03-17 19:52:19,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:19,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:19,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:19,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:19,351 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:19,351 INFO L754 eck$LassoCheckResult]: Loop: "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:19,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:19,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1140143431, now seen corresponding path program 1 times [2025-03-17 19:52:19,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:19,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152378660] [2025-03-17 19:52:19,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:19,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:19,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 19:52:19,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 19:52:19,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:19,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 19:52:19,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:19,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152378660] [2025-03-17 19:52:19,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152378660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:19,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606048827] [2025-03-17 19:52:19,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:19,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:19,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:19,412 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:19,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-03-17 19:52:19,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 19:52:19,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 19:52:19,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:19,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:19,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:52:19,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 19:52:19,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:52:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606048827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:19,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:52:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-03-17 19:52:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233477425] [2025-03-17 19:52:19,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:19,490 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:19,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:19,490 INFO L85 PathProgramCache]: Analyzing trace with hash -167921846, now seen corresponding path program 5 times [2025-03-17 19:52:19,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:19,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340224266] [2025-03-17 19:52:19,490 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:19,493 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 8 equivalence classes. [2025-03-17 19:52:19,497 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:52:19,497 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-17 19:52:19,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 27 proven. 43 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 19:52:19,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:19,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340224266] [2025-03-17 19:52:19,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340224266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:19,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372753566] [2025-03-17 19:52:19,605 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:19,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:19,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:19,607 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:19,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-03-17 19:52:19,648 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 8 equivalence classes. [2025-03-17 19:52:19,659 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:52:19,659 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-17 19:52:19,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:19,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 19:52:19,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 19:52:19,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 23 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 19:52:20,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372753566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:20,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:20,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 21 [2025-03-17 19:52:20,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530019877] [2025-03-17 19:52:20,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:20,018 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:20,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:20,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 19:52:20,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-17 19:52:20,018 INFO L87 Difference]: Start difference. First operand 1058 states and 1600 transitions. cyclomatic complexity: 562 Second operand has 21 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 13 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 11 states have call predecessors, (16), 13 states have call successors, (16) [2025-03-17 19:52:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:20,538 INFO L93 Difference]: Finished difference Result 1766 states and 2570 transitions. [2025-03-17 19:52:20,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1766 states and 2570 transitions. [2025-03-17 19:52:20,548 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 228 [2025-03-17 19:52:20,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1766 states to 1598 states and 2378 transitions. [2025-03-17 19:52:20,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 413 [2025-03-17 19:52:20,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 413 [2025-03-17 19:52:20,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1598 states and 2378 transitions. [2025-03-17 19:52:20,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:20,560 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1598 states and 2378 transitions. [2025-03-17 19:52:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states and 2378 transitions. [2025-03-17 19:52:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1208. [2025-03-17 19:52:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 738 states have (on average 1.1436314363143631) internal successors, (844), 739 states have internal predecessors, (844), 326 states have call successors, (326), 170 states have call predecessors, (326), 144 states have return successors, (652), 298 states have call predecessors, (652), 326 states have call successors, (652) [2025-03-17 19:52:20,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1822 transitions. [2025-03-17 19:52:20,588 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1208 states and 1822 transitions. [2025-03-17 19:52:20,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 19:52:20,589 INFO L432 stractBuchiCegarLoop]: Abstraction has 1208 states and 1822 transitions. [2025-03-17 19:52:20,589 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-17 19:52:20,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1208 states and 1822 transitions. [2025-03-17 19:52:20,594 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2025-03-17 19:52:20,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:20,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:20,596 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:20,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:20,596 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:20,596 INFO L754 eck$LassoCheckResult]: Loop: "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:20,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:20,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1140143431, now seen corresponding path program 2 times [2025-03-17 19:52:20,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:20,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10453024] [2025-03-17 19:52:20,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:20,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:20,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-17 19:52:20,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 19:52:20,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:20,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 19:52:20,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:20,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10453024] [2025-03-17 19:52:20,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10453024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:20,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602649793] [2025-03-17 19:52:20,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:20,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:20,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:20,675 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:20,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2025-03-17 19:52:20,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-17 19:52:20,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 19:52:20,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:20,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:20,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:52:20,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 19:52:20,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:52:20,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602649793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:20,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:52:20,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-03-17 19:52:20,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539695109] [2025-03-17 19:52:20,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:20,759 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:20,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2015745006, now seen corresponding path program 6 times [2025-03-17 19:52:20,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:20,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578691965] [2025-03-17 19:52:20,760 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:20,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:20,764 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 13 equivalence classes. [2025-03-17 19:52:20,778 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 19:52:20,778 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-17 19:52:20,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 29 proven. 130 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-17 19:52:20,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:20,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578691965] [2025-03-17 19:52:20,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578691965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:20,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355113266] [2025-03-17 19:52:20,955 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:20,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:20,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:20,958 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:20,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2025-03-17 19:52:21,002 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 13 equivalence classes. [2025-03-17 19:52:21,103 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 19:52:21,103 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-17 19:52:21,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:21,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 19:52:21,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 128 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-17 19:52:21,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 141 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 19:52:21,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355113266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:21,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:21,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 16] total 25 [2025-03-17 19:52:21,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261814408] [2025-03-17 19:52:21,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:21,726 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:21,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:21,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:52:21,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:52:21,727 INFO L87 Difference]: Start difference. First operand 1208 states and 1822 transitions. cyclomatic complexity: 634 Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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) [2025-03-17 19:52:21,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:21,820 INFO L93 Difference]: Finished difference Result 997 states and 1476 transitions. [2025-03-17 19:52:21,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 997 states and 1476 transitions. [2025-03-17 19:52:21,826 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2025-03-17 19:52:21,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 997 states to 751 states and 1164 transitions. [2025-03-17 19:52:21,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2025-03-17 19:52:21,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2025-03-17 19:52:21,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 751 states and 1164 transitions. [2025-03-17 19:52:21,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:21,833 INFO L218 hiAutomatonCegarLoop]: Abstraction has 751 states and 1164 transitions. [2025-03-17 19:52:21,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states and 1164 transitions. [2025-03-17 19:52:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 743. [2025-03-17 19:52:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 445 states have (on average 1.1146067415730336) internal successors, (496), 440 states have internal predecessors, (496), 218 states have call successors, (218), 94 states have call predecessors, (218), 80 states have return successors, (442), 208 states have call predecessors, (442), 218 states have call successors, (442) [2025-03-17 19:52:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1156 transitions. [2025-03-17 19:52:21,851 INFO L240 hiAutomatonCegarLoop]: Abstraction has 743 states and 1156 transitions. [2025-03-17 19:52:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:52:21,851 INFO L432 stractBuchiCegarLoop]: Abstraction has 743 states and 1156 transitions. [2025-03-17 19:52:21,851 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-17 19:52:21,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 743 states and 1156 transitions. [2025-03-17 19:52:21,853 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2025-03-17 19:52:21,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:21,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:21,854 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:21,854 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:21,854 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:21,854 INFO L754 eck$LassoCheckResult]: Loop: "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:21,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:21,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1121742805, now seen corresponding path program 3 times [2025-03-17 19:52:21,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:21,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362481083] [2025-03-17 19:52:21,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:21,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:21,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 7 equivalence classes. [2025-03-17 19:52:21,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 19:52:21,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 19:52:21,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:21,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1846984528] [2025-03-17 19:52:21,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:21,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:21,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:21,911 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:21,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2025-03-17 19:52:21,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 7 equivalence classes. [2025-03-17 19:52:21,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 19:52:21,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 19:52:21,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:21,984 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:21,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 19:52:21,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 19:52:21,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:21,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:22,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:22,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:22,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2015745006, now seen corresponding path program 7 times [2025-03-17 19:52:22,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:22,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115953887] [2025-03-17 19:52:22,009 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:22,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:22,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 19:52:22,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 19:52:22,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:22,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 28 proven. 131 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-17 19:52:22,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:22,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115953887] [2025-03-17 19:52:22,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115953887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:22,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307161778] [2025-03-17 19:52:22,180 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:22,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:22,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:22,184 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:22,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2025-03-17 19:52:22,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 19:52:22,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 19:52:22,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:22,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:22,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 19:52:22,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 128 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-17 19:52:22,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 141 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 19:52:22,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307161778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:22,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:22,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 16] total 25 [2025-03-17 19:52:22,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249956211] [2025-03-17 19:52:22,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:22,837 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:22,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:22,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 19:52:22,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2025-03-17 19:52:22,838 INFO L87 Difference]: Start difference. First operand 743 states and 1156 transitions. cyclomatic complexity: 427 Second operand has 25 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 15 states have call successors, (19) [2025-03-17 19:52:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:23,216 INFO L93 Difference]: Finished difference Result 1101 states and 1914 transitions. [2025-03-17 19:52:23,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1101 states and 1914 transitions. [2025-03-17 19:52:23,222 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 200 [2025-03-17 19:52:23,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1101 states to 1095 states and 1908 transitions. [2025-03-17 19:52:23,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2025-03-17 19:52:23,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2025-03-17 19:52:23,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1095 states and 1908 transitions. [2025-03-17 19:52:23,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:23,231 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1095 states and 1908 transitions. [2025-03-17 19:52:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states and 1908 transitions. [2025-03-17 19:52:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 841. [2025-03-17 19:52:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 493 states have (on average 1.103448275862069) internal successors, (544), 480 states have internal predecessors, (544), 254 states have call successors, (254), 106 states have call predecessors, (254), 94 states have return successors, (672), 254 states have call predecessors, (672), 254 states have call successors, (672) [2025-03-17 19:52:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1470 transitions. [2025-03-17 19:52:23,256 INFO L240 hiAutomatonCegarLoop]: Abstraction has 841 states and 1470 transitions. [2025-03-17 19:52:23,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 19:52:23,256 INFO L432 stractBuchiCegarLoop]: Abstraction has 841 states and 1470 transitions. [2025-03-17 19:52:23,256 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-17 19:52:23,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 841 states and 1470 transitions. [2025-03-17 19:52:23,258 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 122 [2025-03-17 19:52:23,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:23,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:23,259 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] [2025-03-17 19:52:23,259 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 16, 10, 10, 10, 10, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:23,260 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-17 19:52:23,260 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-17 19:52:23,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:23,261 INFO L85 PathProgramCache]: Analyzing trace with hash 414288056, now seen corresponding path program 1 times [2025-03-17 19:52:23,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:23,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392082912] [2025-03-17 19:52:23,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:23,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:23,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 19:52:23,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 19:52:23,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:23,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:23,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951031833] [2025-03-17 19:52:23,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:23,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:23,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:23,277 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:23,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2025-03-17 19:52:23,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 19:52:23,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 19:52:23,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:23,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:23,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:23,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 19:52:23,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 19:52:23,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:23,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:23,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:23,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:23,372 INFO L85 PathProgramCache]: Analyzing trace with hash 217868990, now seen corresponding path program 1 times [2025-03-17 19:52:23,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:23,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383009189] [2025-03-17 19:52:23,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:23,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:23,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 19:52:23,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 19:52:23,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:23,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 42 proven. 26 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-17 19:52:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383009189] [2025-03-17 19:52:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383009189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414769034] [2025-03-17 19:52:23,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:23,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:23,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:23,472 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:23,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2025-03-17 19:52:23,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 19:52:23,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 19:52:23,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:23,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:23,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:52:23,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 286 proven. 126 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-03-17 19:52:23,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 34 proven. 226 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2025-03-17 19:52:24,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414769034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:24,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:24,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 16] total 23 [2025-03-17 19:52:24,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130687238] [2025-03-17 19:52:24,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:24,146 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:24,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:24,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 19:52:24,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2025-03-17 19:52:24,146 INFO L87 Difference]: Start difference. First operand 841 states and 1470 transitions. cyclomatic complexity: 643 Second operand has 23 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 21 states have internal predecessors, (53), 14 states have call successors, (22), 2 states have call predecessors, (22), 7 states have return successors, (24), 11 states have call predecessors, (24), 14 states have call successors, (24) [2025-03-17 19:52:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:24,767 INFO L93 Difference]: Finished difference Result 1218 states and 2195 transitions. [2025-03-17 19:52:24,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1218 states and 2195 transitions. [2025-03-17 19:52:24,774 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 226 [2025-03-17 19:52:24,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1218 states to 1192 states and 2153 transitions. [2025-03-17 19:52:24,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 454 [2025-03-17 19:52:24,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 454 [2025-03-17 19:52:24,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1192 states and 2153 transitions. [2025-03-17 19:52:24,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:24,816 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1192 states and 2153 transitions. [2025-03-17 19:52:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states and 2153 transitions. [2025-03-17 19:52:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 946. [2025-03-17 19:52:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 556 states have (on average 1.0881294964028776) internal successors, (605), 538 states have internal predecessors, (605), 296 states have call successors, (296), 113 states have call predecessors, (296), 94 states have return successors, (766), 294 states have call predecessors, (766), 296 states have call successors, (766) [2025-03-17 19:52:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1667 transitions. [2025-03-17 19:52:24,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 946 states and 1667 transitions. [2025-03-17 19:52:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 19:52:24,839 INFO L432 stractBuchiCegarLoop]: Abstraction has 946 states and 1667 transitions. [2025-03-17 19:52:24,839 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-17 19:52:24,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 946 states and 1667 transitions. [2025-03-17 19:52:24,842 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2025-03-17 19:52:24,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:24,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:24,843 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] [2025-03-17 19:52:24,843 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 12, 12, 12, 12, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:24,843 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-17 19:52:24,844 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-17 19:52:24,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash 414288056, now seen corresponding path program 2 times [2025-03-17 19:52:24,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:24,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781709677] [2025-03-17 19:52:24,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:24,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:24,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-03-17 19:52:24,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 19:52:24,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:24,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:24,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [341978230] [2025-03-17 19:52:24,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:24,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:24,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:24,855 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:24,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2025-03-17 19:52:24,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-03-17 19:52:24,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 19:52:24,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:24,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:24,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:24,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 19:52:24,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 19:52:24,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:24,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:24,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:24,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:24,955 INFO L85 PathProgramCache]: Analyzing trace with hash -912195175, now seen corresponding path program 2 times [2025-03-17 19:52:24,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:24,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744918130] [2025-03-17 19:52:24,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:24,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:24,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 134 statements into 2 equivalence classes. [2025-03-17 19:52:24,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 19:52:24,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:24,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 62 proven. 86 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-03-17 19:52:25,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:25,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744918130] [2025-03-17 19:52:25,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744918130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:25,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196795250] [2025-03-17 19:52:25,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:25,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:25,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:25,093 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:25,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2025-03-17 19:52:25,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 134 statements into 2 equivalence classes. [2025-03-17 19:52:25,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 19:52:25,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:25,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:25,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:52:25,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 579 proven. 76 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-17 19:52:25,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 69 proven. 228 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2025-03-17 19:52:25,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196795250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:25,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:25,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 13] total 21 [2025-03-17 19:52:25,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859557543] [2025-03-17 19:52:25,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:25,553 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:25,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:25,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 19:52:25,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-17 19:52:25,554 INFO L87 Difference]: Start difference. First operand 946 states and 1667 transitions. cyclomatic complexity: 735 Second operand has 21 states, 16 states have (on average 3.6875) internal successors, (59), 21 states have internal predecessors, (59), 15 states have call successors, (29), 2 states have call predecessors, (29), 6 states have return successors, (29), 9 states have call predecessors, (29), 15 states have call successors, (29) [2025-03-17 19:52:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:26,035 INFO L93 Difference]: Finished difference Result 1053 states and 1732 transitions. [2025-03-17 19:52:26,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1053 states and 1732 transitions. [2025-03-17 19:52:26,042 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 175 [2025-03-17 19:52:26,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1053 states to 872 states and 1374 transitions. [2025-03-17 19:52:26,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 391 [2025-03-17 19:52:26,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 392 [2025-03-17 19:52:26,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 872 states and 1374 transitions. [2025-03-17 19:52:26,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:26,049 INFO L218 hiAutomatonCegarLoop]: Abstraction has 872 states and 1374 transitions. [2025-03-17 19:52:26,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states and 1374 transitions. [2025-03-17 19:52:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 825. [2025-03-17 19:52:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 515 states have (on average 1.0970873786407767) internal successors, (565), 502 states have internal predecessors, (565), 221 states have call successors, (221), 102 states have call predecessors, (221), 89 states have return successors, (521), 220 states have call predecessors, (521), 221 states have call successors, (521) [2025-03-17 19:52:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1307 transitions. [2025-03-17 19:52:26,069 INFO L240 hiAutomatonCegarLoop]: Abstraction has 825 states and 1307 transitions. [2025-03-17 19:52:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 19:52:26,070 INFO L432 stractBuchiCegarLoop]: Abstraction has 825 states and 1307 transitions. [2025-03-17 19:52:26,070 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-17 19:52:26,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 825 states and 1307 transitions. [2025-03-17 19:52:26,073 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 170 [2025-03-17 19:52:26,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:26,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:26,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:26,074 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] [2025-03-17 19:52:26,075 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" [2025-03-17 19:52:26,075 INFO L754 eck$LassoCheckResult]: Loop: "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" [2025-03-17 19:52:26,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:26,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1816443903, now seen corresponding path program 3 times [2025-03-17 19:52:26,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:26,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834630399] [2025-03-17 19:52:26,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:26,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:26,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 8 equivalence classes. [2025-03-17 19:52:26,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 19:52:26,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 19:52:26,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:26,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [704371651] [2025-03-17 19:52:26,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:26,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:26,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,103 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2025-03-17 19:52:26,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 8 equivalence classes. [2025-03-17 19:52:26,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 19:52:26,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 19:52:26,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:26,183 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:26,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 19:52:26,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 19:52:26,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:26,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:26,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:26,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:26,212 INFO L85 PathProgramCache]: Analyzing trace with hash -413088015, now seen corresponding path program 3 times [2025-03-17 19:52:26,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:26,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317825803] [2025-03-17 19:52:26,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:26,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:26,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 12 equivalence classes. [2025-03-17 19:52:26,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 61 of 110 statements. [2025-03-17 19:52:26,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 19:52:26,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 125 proven. 51 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-03-17 19:52:26,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:26,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317825803] [2025-03-17 19:52:26,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317825803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:26,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153908819] [2025-03-17 19:52:26,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:26,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:26,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,326 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2025-03-17 19:52:26,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 12 equivalence classes. [2025-03-17 19:52:26,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 61 of 110 statements. [2025-03-17 19:52:26,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 19:52:26,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:26,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:52:26,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 131 proven. 44 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-03-17 19:52:26,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 131 proven. 45 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-03-17 19:52:26,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153908819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:26,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:26,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 16 [2025-03-17 19:52:26,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976904131] [2025-03-17 19:52:26,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:26,627 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:26,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 19:52:26,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-17 19:52:26,627 INFO L87 Difference]: Start difference. First operand 825 states and 1307 transitions. cyclomatic complexity: 499 Second operand has 17 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 16 states have internal predecessors, (41), 9 states have call successors, (17), 1 states have call predecessors, (17), 4 states have return successors, (17), 7 states have call predecessors, (17), 9 states have call successors, (17) [2025-03-17 19:52:26,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:26,976 INFO L93 Difference]: Finished difference Result 1051 states and 1832 transitions. [2025-03-17 19:52:26,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1051 states and 1832 transitions. [2025-03-17 19:52:26,982 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 265 [2025-03-17 19:52:27,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1051 states to 1043 states and 1823 transitions. [2025-03-17 19:52:27,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 493 [2025-03-17 19:52:27,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 494 [2025-03-17 19:52:27,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1043 states and 1823 transitions. [2025-03-17 19:52:27,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:27,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1043 states and 1823 transitions. [2025-03-17 19:52:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states and 1823 transitions. [2025-03-17 19:52:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 979. [2025-03-17 19:52:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 588 states have (on average 1.1054421768707483) internal successors, (650), 573 states have internal predecessors, (650), 302 states have call successors, (302), 102 states have call predecessors, (302), 89 states have return successors, (750), 303 states have call predecessors, (750), 302 states have call successors, (750) [2025-03-17 19:52:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1702 transitions. [2025-03-17 19:52:27,028 INFO L240 hiAutomatonCegarLoop]: Abstraction has 979 states and 1702 transitions. [2025-03-17 19:52:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 19:52:27,029 INFO L432 stractBuchiCegarLoop]: Abstraction has 979 states and 1702 transitions. [2025-03-17 19:52:27,029 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-17 19:52:27,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 979 states and 1702 transitions. [2025-03-17 19:52:27,031 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 265 [2025-03-17 19:52:27,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:27,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:27,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:27,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:27,032 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:27,032 INFO L754 eck$LassoCheckResult]: Loop: "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:27,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1121742805, now seen corresponding path program 4 times [2025-03-17 19:52:27,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:27,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511840213] [2025-03-17 19:52:27,033 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:27,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:27,037 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-03-17 19:52:27,042 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 19:52:27,042 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:27,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:27,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [511012278] [2025-03-17 19:52:27,043 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:27,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:27,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,045 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) [2025-03-17 19:52:27,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2025-03-17 19:52:27,102 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-03-17 19:52:27,116 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 19:52:27,116 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:27,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:27,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 19:52:27,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 19:52:27,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:27,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,142 INFO L85 PathProgramCache]: Analyzing trace with hash -670544530, now seen corresponding path program 8 times [2025-03-17 19:52:27,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:27,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679634736] [2025-03-17 19:52:27,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:27,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:27,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-17 19:52:27,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 19:52:27,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:27,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:27,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [69766254] [2025-03-17 19:52:27,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:27,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:27,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,155 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) [2025-03-17 19:52:27,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2025-03-17 19:52:27,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-17 19:52:27,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 19:52:27,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:27,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,254 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:27,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 19:52:27,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 19:52:27,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:27,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:27,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,300 INFO L85 PathProgramCache]: Analyzing trace with hash 789971522, now seen corresponding path program 5 times [2025-03-17 19:52:27,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:27,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252027998] [2025-03-17 19:52:27,300 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:27,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:27,306 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 119 statements into 14 equivalence classes. [2025-03-17 19:52:27,313 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 114 of 119 statements. [2025-03-17 19:52:27,313 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-17 19:52:27,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 107 proven. 181 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2025-03-17 19:52:27,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:27,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252027998] [2025-03-17 19:52:27,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252027998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:27,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758417798] [2025-03-17 19:52:27,538 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:27,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:27,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:27,540 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) [2025-03-17 19:52:27,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2025-03-17 19:52:27,607 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 119 statements into 14 equivalence classes. [2025-03-17 19:52:27,636 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 114 of 119 statements. [2025-03-17 19:52:27,636 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-17 19:52:27,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:27,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:52:27,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 233 proven. 13 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2025-03-17 19:52:27,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 233 proven. 22 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2025-03-17 19:52:28,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758417798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:28,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:28,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 14] total 27 [2025-03-17 19:52:28,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847651077] [2025-03-17 19:52:28,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:28,448 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:28,448 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:28,448 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:28,448 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:28,448 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:28,448 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,448 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:28,449 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:28,449 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration20_Loop [2025-03-17 19:52:28,449 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:28,449 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:28,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,503 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:28,504 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:28,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,507 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) [2025-03-17 19:52:28,508 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 [2025-03-17 19:52:28,508 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,508 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,519 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,519 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: [] [2025-03-17 19:52:28,525 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 [2025-03-17 19:52:28,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,531 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) [2025-03-17 19:52:28,534 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 [2025-03-17 19:52:28,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,535 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,550 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,551 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: [] [2025-03-17 19:52:28,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:28,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,559 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) [2025-03-17 19:52:28,561 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 [2025-03-17 19:52:28,562 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,562 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,579 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,579 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: [] [2025-03-17 19:52:28,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:28,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,588 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) [2025-03-17 19:52:28,590 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 [2025-03-17 19:52:28,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,603 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,603 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: [] [2025-03-17 19:52:28,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:28,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,611 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) [2025-03-17 19:52:28,613 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 [2025-03-17 19:52:28,614 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,614 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,631 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,631 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=4} Honda state: {ULTIMATE.start_main_~x~0#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:28,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:28,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,640 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) [2025-03-17 19:52:28,641 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 [2025-03-17 19:52:28,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,656 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,656 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: [] [2025-03-17 19:52:28,662 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 [2025-03-17 19:52:28,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,665 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) [2025-03-17 19:52:28,665 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 [2025-03-17 19:52:28,667 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,679 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,679 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:28,685 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 [2025-03-17 19:52:28,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,687 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) [2025-03-17 19:52:28,687 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 [2025-03-17 19:52:28,688 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,688 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,699 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,699 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: [] [2025-03-17 19:52:28,704 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 [2025-03-17 19:52:28,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,707 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) [2025-03-17 19:52:28,707 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 [2025-03-17 19:52:28,708 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,708 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,718 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,718 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: [] [2025-03-17 19:52:28,723 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 [2025-03-17 19:52:28,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,726 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) [2025-03-17 19:52:28,726 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 [2025-03-17 19:52:28,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,738 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,738 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: [] [2025-03-17 19:52:28,743 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 [2025-03-17 19:52:28,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,745 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) [2025-03-17 19:52:28,746 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 [2025-03-17 19:52:28,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,758 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:28,758 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: [] [2025-03-17 19:52:28,763 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 [2025-03-17 19:52:28,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,765 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) [2025-03-17 19:52:28,766 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 [2025-03-17 19:52:28,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:28,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:28,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,786 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) [2025-03-17 19:52:28,786 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 [2025-03-17 19:52:28,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:28,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:28,798 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:28,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-03-17 19:52:28,804 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:28,804 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:28,804 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:28,804 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:28,804 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:28,804 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,804 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:28,804 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:28,804 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration20_Loop [2025-03-17 19:52:28,804 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:28,804 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:28,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:28,854 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:28,855 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:28,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,857 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) [2025-03-17 19:52:28,858 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 [2025-03-17 19:52:28,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:28,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:28,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:28,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:28,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:28,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:28,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:28,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:28,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:28,875 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 [2025-03-17 19:52:28,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,877 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) [2025-03-17 19:52:28,877 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 [2025-03-17 19:52:28,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:28,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:28,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:28,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:28,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:28,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:28,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:28,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:28,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:28,894 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 [2025-03-17 19:52:28,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,896 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) [2025-03-17 19:52:28,897 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 [2025-03-17 19:52:28,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:28,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:28,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:28,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:28,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:28,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:28,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:28,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:28,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:28,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-03-17 19:52:28,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,917 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-03-17 19:52:28,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:28,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:28,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:28,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:28,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:28,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:28,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:28,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:28,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:28,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-03-17 19:52:28,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,938 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-03-17 19:52:28,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:28,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:28,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:28,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:28,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:28,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:28,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:28,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:28,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:28,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:28,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,965 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:28,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-03-17 19:52:28,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:28,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:28,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:28,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:28,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:28,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:28,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:28,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:28,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:28,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:28,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:28,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:28,990 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) [2025-03-17 19:52:28,992 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 [2025-03-17 19:52:28,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:29,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:29,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:29,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:29,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:29,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:29,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:29,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:29,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:29,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:29,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,012 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) [2025-03-17 19:52:29,013 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 [2025-03-17 19:52:29,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:29,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:29,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:29,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:29,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:29,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:29,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:29,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:29,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:29,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-03-17 19:52:29,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,036 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) [2025-03-17 19:52:29,037 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 [2025-03-17 19:52:29,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:29,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:29,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:29,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:29,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:29,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:29,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:29,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:29,049 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:29,054 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 [2025-03-17 19:52:29,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,056 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) [2025-03-17 19:52:29,057 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 [2025-03-17 19:52:29,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 [2025-03-17 19:52:29,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:29,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:29,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:29,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:29,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:29,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:29,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:29,069 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:29,074 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 [2025-03-17 19:52:29,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,076 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) [2025-03-17 19:52:29,076 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 [2025-03-17 19:52:29,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:29,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:29,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:29,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:29,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:29,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:29,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:29,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:29,089 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:29,095 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 [2025-03-17 19:52:29,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,097 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) [2025-03-17 19:52:29,097 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 [2025-03-17 19:52:29,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:29,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:29,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:29,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:29,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:29,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:29,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:29,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:29,111 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:29,112 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:29,112 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:29,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:29,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,115 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) [2025-03-17 19:52:29,115 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 [2025-03-17 19:52:29,116 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:29,116 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:29,116 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:29,116 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 [] [2025-03-17 19:52:29,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:29,122 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:29,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:29,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 19:52:29,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 19:52:29,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:29,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:29,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:52:29,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:29,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 19:52:29,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 19:52:29,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:29,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:29,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 19:52:29,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-17 19:52:29,563 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 [2025-03-17 19:52:29,563 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 979 states and 1702 transitions. cyclomatic complexity: 750 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) [2025-03-17 19:52:29,785 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 979 states and 1702 transitions. cyclomatic complexity: 750. 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 1726 states and 2867 transitions. Complement of second has 65 states. [2025-03-17 19:52:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:29,786 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) [2025-03-17 19:52:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2025-03-17 19:52:29,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 68 transitions. Stem has 57 letters. Loop has 62 letters. [2025-03-17 19:52:29,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:29,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 68 transitions. Stem has 119 letters. Loop has 62 letters. [2025-03-17 19:52:29,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:29,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 68 transitions. Stem has 57 letters. Loop has 124 letters. [2025-03-17 19:52:29,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:29,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1726 states and 2867 transitions. [2025-03-17 19:52:29,814 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 [2025-03-17 19:52:29,815 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 262 [2025-03-17 19:52:29,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1726 states to 1280 states and 2177 transitions. [2025-03-17 19:52:29,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 443 [2025-03-17 19:52:29,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 445 [2025-03-17 19:52:29,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1280 states and 2177 transitions. [2025-03-17 19:52:29,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:29,823 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1280 states and 2177 transitions. [2025-03-17 19:52:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states and 2177 transitions. [2025-03-17 19:52:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1219. [2025-03-17 19:52:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 742 states have (on average 1.110512129380054) internal successors, (824), 727 states have internal predecessors, (824), 352 states have call successors, (352), 130 states have call predecessors, (352), 125 states have return successors, (872), 361 states have call predecessors, (872), 352 states have call successors, (872) [2025-03-17 19:52:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2048 transitions. [2025-03-17 19:52:29,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1219 states and 2048 transitions. [2025-03-17 19:52:29,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:29,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 19:52:29,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2025-03-17 19:52:29,848 INFO L87 Difference]: Start difference. First operand 1219 states and 2048 transitions. Second operand has 27 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 26 states have internal predecessors, (70), 16 states have call successors, (34), 1 states have call predecessors, (34), 7 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) [2025-03-17 19:52:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:30,773 INFO L93 Difference]: Finished difference Result 1986 states and 3529 transitions. [2025-03-17 19:52:30,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1986 states and 3529 transitions. [2025-03-17 19:52:30,787 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 433 [2025-03-17 19:52:30,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1986 states to 1962 states and 3493 transitions. [2025-03-17 19:52:30,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 730 [2025-03-17 19:52:30,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 730 [2025-03-17 19:52:30,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1962 states and 3493 transitions. [2025-03-17 19:52:30,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:30,807 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1962 states and 3493 transitions. [2025-03-17 19:52:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states and 3493 transitions. [2025-03-17 19:52:30,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1629. [2025-03-17 19:52:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 926 states have (on average 1.1403887688984882) internal successors, (1056), 919 states have internal predecessors, (1056), 570 states have call successors, (570), 130 states have call predecessors, (570), 133 states have return successors, (1422), 579 states have call predecessors, (1422), 570 states have call successors, (1422) [2025-03-17 19:52:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 3048 transitions. [2025-03-17 19:52:30,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1629 states and 3048 transitions. [2025-03-17 19:52:30,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-17 19:52:30,857 INFO L432 stractBuchiCegarLoop]: Abstraction has 1629 states and 3048 transitions. [2025-03-17 19:52:30,857 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-17 19:52:30,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1629 states and 3048 transitions. [2025-03-17 19:52:30,862 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 369 [2025-03-17 19:52:30,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:30,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:30,863 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:30,863 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:30,863 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" [2025-03-17 19:52:30,864 INFO L754 eck$LassoCheckResult]: Loop: "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" [2025-03-17 19:52:30,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1764626161, now seen corresponding path program 4 times [2025-03-17 19:52:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:30,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78722436] [2025-03-17 19:52:30,864 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:30,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:30,868 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-03-17 19:52:30,874 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 19:52:30,874 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:30,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:30,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419824140] [2025-03-17 19:52:30,875 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:30,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:30,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:30,877 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:30,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2025-03-17 19:52:30,967 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-03-17 19:52:30,994 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 19:52:30,994 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:30,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:30,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:31,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 19:52:31,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 19:52:31,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:31,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:31,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:31,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:31,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1714291528, now seen corresponding path program 5 times [2025-03-17 19:52:31,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:31,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822535996] [2025-03-17 19:52:31,024 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:31,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:31,027 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 9 equivalence classes. [2025-03-17 19:52:31,031 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:52:31,031 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-17 19:52:31,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:31,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1029087708] [2025-03-17 19:52:31,032 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:31,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:31,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:31,034 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:31,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2025-03-17 19:52:31,106 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 9 equivalence classes. [2025-03-17 19:52:31,130 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:52:31,130 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-17 19:52:31,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:31,130 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:31,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 19:52:31,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:52:31,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:31,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:31,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:31,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:31,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1560195514, now seen corresponding path program 5 times [2025-03-17 19:52:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:31,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820950361] [2025-03-17 19:52:31,152 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:31,158 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 126 statements into 9 equivalence classes. [2025-03-17 19:52:31,170 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 19:52:31,170 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-17 19:52:31,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 228 proven. 119 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2025-03-17 19:52:31,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:31,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820950361] [2025-03-17 19:52:31,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820950361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:31,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940417982] [2025-03-17 19:52:31,400 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:31,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:31,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:31,404 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:31,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2025-03-17 19:52:31,480 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 126 statements into 9 equivalence classes. [2025-03-17 19:52:31,628 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 19:52:31,628 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-17 19:52:31,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:31,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 19:52:31,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 362 proven. 57 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-17 19:52:31,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 156 proven. 101 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 19:52:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940417982] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:31,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:31,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 13] total 20 [2025-03-17 19:52:31,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337719674] [2025-03-17 19:52:31,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:32,171 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:32,171 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:32,171 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:32,171 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:32,171 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:32,171 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:32,171 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:32,171 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:32,171 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration21_Loop [2025-03-17 19:52:32,171 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:32,171 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:32,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,248 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:32,248 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:32,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:32,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:32,251 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) [2025-03-17 19:52:32,252 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 [2025-03-17 19:52:32,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:32,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:32,272 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 [2025-03-17 19:52:32,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:32,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:32,275 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) [2025-03-17 19:52:32,276 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 [2025-03-17 19:52:32,277 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:32,277 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:32,500 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:32,507 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 [2025-03-17 19:52:32,507 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:32,507 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:32,507 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:32,507 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:32,507 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:32,507 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:32,507 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:32,507 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:32,507 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration21_Loop [2025-03-17 19:52:32,507 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:32,507 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:32,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:32,585 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:32,585 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:32,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:32,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:32,587 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) [2025-03-17 19:52:32,588 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 [2025-03-17 19:52:32,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:32,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:32,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:32,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:32,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:32,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:32,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:32,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:32,602 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:32,604 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 19:52:32,604 INFO L444 ModelExtractionUtils]: 4 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:32,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:32,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:32,607 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) [2025-03-17 19:52:32,608 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 [2025-03-17 19:52:32,608 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:32,608 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:32,608 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:32,609 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 [] [2025-03-17 19:52:32,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-03-17 19:52:32,616 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:32,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:32,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 19:52:32,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 19:52:32,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:32,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:32,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 19:52:32,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:33,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 19:52:33,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:52:33,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:33,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:33,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 19:52:33,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-17 19:52:33,182 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 [2025-03-17 19:52:33,182 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1629 states and 3048 transitions. cyclomatic complexity: 1452 Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 19:52:33,351 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1629 states and 3048 transitions. cyclomatic complexity: 1452. Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Result 2532 states and 4569 transitions. Complement of second has 44 states. [2025-03-17 19:52:33,355 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 [2025-03-17 19:52:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 19:52:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2025-03-17 19:52:33,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 76 letters. Loop has 50 letters. [2025-03-17 19:52:33,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:33,356 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:33,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:33,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 19:52:33,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 19:52:33,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:33,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:33,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 19:52:33,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:33,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 19:52:33,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:52:33,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:33,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:33,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 19:52:33,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-17 19:52:33,848 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2025-03-17 19:52:33,848 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1629 states and 3048 transitions. cyclomatic complexity: 1452 Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 19:52:34,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-03-17 19:52:34,045 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1629 states and 3048 transitions. cyclomatic complexity: 1452. Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Result 2540 states and 4581 transitions. Complement of second has 50 states. [2025-03-17 19:52:34,046 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 [2025-03-17 19:52:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 19:52:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2025-03-17 19:52:34,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 53 transitions. Stem has 76 letters. Loop has 50 letters. [2025-03-17 19:52:34,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:34,047 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:34,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:34,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 19:52:34,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 19:52:34,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:34,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:34,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 19:52:34,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:34,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 19:52:34,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:52:34,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:34,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:34,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 19:52:34,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-17 19:52:34,511 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 8 loop predicates [2025-03-17 19:52:34,511 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1629 states and 3048 transitions. cyclomatic complexity: 1452 Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 19:52:34,730 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1629 states and 3048 transitions. cyclomatic complexity: 1452. Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Result 3792 states and 6664 transitions. Complement of second has 90 states. [2025-03-17 19:52:34,730 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 [2025-03-17 19:52:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 19:52:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 95 transitions. [2025-03-17 19:52:34,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 95 transitions. Stem has 76 letters. Loop has 50 letters. [2025-03-17 19:52:34,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:34,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 95 transitions. Stem has 126 letters. Loop has 50 letters. [2025-03-17 19:52:34,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:34,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 95 transitions. Stem has 76 letters. Loop has 100 letters. [2025-03-17 19:52:34,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:34,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3792 states and 6664 transitions. [2025-03-17 19:52:34,773 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 279 [2025-03-17 19:52:34,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3792 states to 2911 states and 4981 transitions. [2025-03-17 19:52:34,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 697 [2025-03-17 19:52:34,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 713 [2025-03-17 19:52:34,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2911 states and 4981 transitions. [2025-03-17 19:52:34,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:34,800 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2911 states and 4981 transitions. [2025-03-17 19:52:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states and 4981 transitions. [2025-03-17 19:52:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2680. [2025-03-17 19:52:34,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2680 states, 1577 states have (on average 1.0951173113506658) internal successors, (1727), 1573 states have internal predecessors, (1727), 820 states have call successors, (845), 245 states have call predecessors, (845), 283 states have return successors, (1985), 861 states have call predecessors, (1985), 820 states have call successors, (1985) [2025-03-17 19:52:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 4557 transitions. [2025-03-17 19:52:34,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2680 states and 4557 transitions. [2025-03-17 19:52:34,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:34,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 19:52:34,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-17 19:52:34,866 INFO L87 Difference]: Start difference. First operand 2680 states and 4557 transitions. Second operand has 20 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 11 states have call successors, (23), 2 states have call predecessors, (23), 8 states have return successors, (26), 9 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-17 19:52:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:35,312 INFO L93 Difference]: Finished difference Result 2887 states and 4876 transitions. [2025-03-17 19:52:35,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2887 states and 4876 transitions. [2025-03-17 19:52:35,332 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 201 [2025-03-17 19:52:35,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2887 states to 2885 states and 4874 transitions. [2025-03-17 19:52:35,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 610 [2025-03-17 19:52:35,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 610 [2025-03-17 19:52:35,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2885 states and 4874 transitions. [2025-03-17 19:52:35,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:35,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2885 states and 4874 transitions. [2025-03-17 19:52:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states and 4874 transitions. [2025-03-17 19:52:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2667. [2025-03-17 19:52:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2667 states, 1569 states have (on average 1.094327597195666) internal successors, (1717), 1564 states have internal predecessors, (1717), 817 states have call successors, (842), 243 states have call predecessors, (842), 281 states have return successors, (1959), 859 states have call predecessors, (1959), 817 states have call successors, (1959) [2025-03-17 19:52:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 4518 transitions. [2025-03-17 19:52:35,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2667 states and 4518 transitions. [2025-03-17 19:52:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 19:52:35,424 INFO L432 stractBuchiCegarLoop]: Abstraction has 2667 states and 4518 transitions. [2025-03-17 19:52:35,424 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-17 19:52:35,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2667 states and 4518 transitions. [2025-03-17 19:52:35,432 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 180 [2025-03-17 19:52:35,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:35,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:35,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:35,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [27, 27, 18, 18, 18, 18, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:35,434 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-17 19:52:35,434 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-17 19:52:35,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:35,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1491362900, now seen corresponding path program 6 times [2025-03-17 19:52:35,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:35,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35760408] [2025-03-17 19:52:35,435 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:35,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:35,441 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 101 statements into 10 equivalence classes. [2025-03-17 19:52:35,451 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 88 of 101 statements. [2025-03-17 19:52:35,451 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-17 19:52:35,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 103 proven. 5 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2025-03-17 19:52:35,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:35,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35760408] [2025-03-17 19:52:35,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35760408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:35,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483921959] [2025-03-17 19:52:35,568 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:35,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:35,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:35,571 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) [2025-03-17 19:52:35,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2025-03-17 19:52:35,654 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 101 statements into 10 equivalence classes. [2025-03-17 19:52:35,676 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 88 of 101 statements. [2025-03-17 19:52:35,677 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-17 19:52:35,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:35,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 19:52:35,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:35,782 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 102 proven. 5 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-03-17 19:52:35,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2025-03-17 19:52:35,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483921959] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:35,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:35,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 18 [2025-03-17 19:52:35,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880367396] [2025-03-17 19:52:35,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:35,958 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:35,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash -538947343, now seen corresponding path program 4 times [2025-03-17 19:52:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:35,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874111656] [2025-03-17 19:52:35,959 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:35,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:35,966 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 170 statements into 2 equivalence classes. [2025-03-17 19:52:35,975 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 19:52:35,975 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:52:35,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 18 proven. 217 refuted. 0 times theorem prover too weak. 1492 trivial. 0 not checked. [2025-03-17 19:52:36,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:36,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874111656] [2025-03-17 19:52:36,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874111656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:36,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998541593] [2025-03-17 19:52:36,127 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:36,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:36,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:36,129 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) [2025-03-17 19:52:36,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2025-03-17 19:52:36,225 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 170 statements into 2 equivalence classes. [2025-03-17 19:52:36,260 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 19:52:36,260 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:52:36,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:36,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 19:52:36,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 1012 proven. 185 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2025-03-17 19:52:36,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 124 proven. 627 refuted. 0 times theorem prover too weak. 976 trivial. 0 not checked. [2025-03-17 19:52:37,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998541593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:37,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:37,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 21] total 29 [2025-03-17 19:52:37,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130911331] [2025-03-17 19:52:37,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:37,298 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:37,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:37,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 19:52:37,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-17 19:52:37,299 INFO L87 Difference]: Start difference. First operand 2667 states and 4518 transitions. cyclomatic complexity: 1896 Second operand has 18 states, 15 states have (on average 3.4) internal successors, (51), 18 states have internal predecessors, (51), 10 states have call successors, (24), 1 states have call predecessors, (24), 3 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2025-03-17 19:52:37,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:37,552 INFO L93 Difference]: Finished difference Result 2320 states and 3478 transitions. [2025-03-17 19:52:37,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2320 states and 3478 transitions. [2025-03-17 19:52:37,565 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 165 [2025-03-17 19:52:37,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2320 states to 1800 states and 2612 transitions. [2025-03-17 19:52:37,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 538 [2025-03-17 19:52:37,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 538 [2025-03-17 19:52:37,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1800 states and 2612 transitions. [2025-03-17 19:52:37,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:37,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1800 states and 2612 transitions. [2025-03-17 19:52:37,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states and 2612 transitions. [2025-03-17 19:52:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1749. [2025-03-17 19:52:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1084 states have (on average 1.0710332103321034) internal successors, (1161), 1073 states have internal predecessors, (1161), 461 states have call successors, (475), 189 states have call predecessors, (475), 204 states have return successors, (907), 486 states have call predecessors, (907), 461 states have call successors, (907) [2025-03-17 19:52:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2543 transitions. [2025-03-17 19:52:37,616 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1749 states and 2543 transitions. [2025-03-17 19:52:37,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 19:52:37,618 INFO L432 stractBuchiCegarLoop]: Abstraction has 1749 states and 2543 transitions. [2025-03-17 19:52:37,618 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-17 19:52:37,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1749 states and 2543 transitions. [2025-03-17 19:52:37,623 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 163 [2025-03-17 19:52:37,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:37,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:37,624 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:37,624 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:37,624 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" [2025-03-17 19:52:37,624 INFO L754 eck$LassoCheckResult]: Loop: "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" [2025-03-17 19:52:37,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:37,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1617522371, now seen corresponding path program 7 times [2025-03-17 19:52:37,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:37,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958903620] [2025-03-17 19:52:37,625 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:37,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:37,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:52:37,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:52:37,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:37,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 65 proven. 52 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2025-03-17 19:52:37,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:37,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958903620] [2025-03-17 19:52:37,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958903620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:37,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071112851] [2025-03-17 19:52:37,708 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:37,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:37,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:37,711 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:37,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2025-03-17 19:52:37,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:52:37,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:52:37,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:37,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:37,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:52:37,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 309 proven. 10 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-03-17 19:52:37,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 65 proven. 53 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-03-17 19:52:37,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071112851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:37,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:37,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 10 [2025-03-17 19:52:37,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800223744] [2025-03-17 19:52:37,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:37,990 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:37,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:37,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1383210994, now seen corresponding path program 6 times [2025-03-17 19:52:37,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:37,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87360462] [2025-03-17 19:52:37,991 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:37,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:37,994 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 74 statements into 15 equivalence classes. [2025-03-17 19:52:38,000 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 19:52:38,000 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-03-17 19:52:38,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 49 proven. 192 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 19:52:38,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:38,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87360462] [2025-03-17 19:52:38,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87360462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:38,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907778729] [2025-03-17 19:52:38,206 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:38,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:38,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:38,210 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:38,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2025-03-17 19:52:38,281 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 74 statements into 15 equivalence classes. [2025-03-17 19:52:38,302 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 19:52:38,303 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-03-17 19:52:38,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:38,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 19:52:38,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 49 proven. 185 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-17 19:52:38,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:39,178 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 49 proven. 213 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-17 19:52:39,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907778729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:39,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:39,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 21] total 26 [2025-03-17 19:52:39,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723012903] [2025-03-17 19:52:39,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:39,179 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:39,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:39,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 19:52:39,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2025-03-17 19:52:39,179 INFO L87 Difference]: Start difference. First operand 1749 states and 2543 transitions. cyclomatic complexity: 825 Second operand has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (21), 13 states have call predecessors, (21), 15 states have call successors, (21) [2025-03-17 19:52:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:39,675 INFO L93 Difference]: Finished difference Result 2253 states and 3546 transitions. [2025-03-17 19:52:39,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2253 states and 3546 transitions. [2025-03-17 19:52:39,684 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 255 [2025-03-17 19:52:39,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2253 states to 2249 states and 3538 transitions. [2025-03-17 19:52:39,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 715 [2025-03-17 19:52:39,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 724 [2025-03-17 19:52:39,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2249 states and 3538 transitions. [2025-03-17 19:52:39,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:39,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2249 states and 3538 transitions. [2025-03-17 19:52:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states and 3538 transitions. [2025-03-17 19:52:39,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 1863. [2025-03-17 19:52:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1863 states, 1147 states have (on average 1.073234524847428) internal successors, (1231), 1127 states have internal predecessors, (1231), 505 states have call successors, (519), 217 states have call predecessors, (519), 211 states have return successors, (1129), 518 states have call predecessors, (1129), 505 states have call successors, (1129) [2025-03-17 19:52:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2879 transitions. [2025-03-17 19:52:39,726 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1863 states and 2879 transitions. [2025-03-17 19:52:39,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 19:52:39,727 INFO L432 stractBuchiCegarLoop]: Abstraction has 1863 states and 2879 transitions. [2025-03-17 19:52:39,727 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-17 19:52:39,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1863 states and 2879 transitions. [2025-03-17 19:52:39,731 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 179 [2025-03-17 19:52:39,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:39,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:39,732 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:39,732 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:39,732 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" [2025-03-17 19:52:39,732 INFO L754 eck$LassoCheckResult]: Loop: "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" [2025-03-17 19:52:39,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:39,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1617522371, now seen corresponding path program 8 times [2025-03-17 19:52:39,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:39,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48760060] [2025-03-17 19:52:39,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:39,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-17 19:52:39,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:52:39,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:39,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 65 proven. 52 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2025-03-17 19:52:39,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:39,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48760060] [2025-03-17 19:52:39,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48760060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:39,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082700252] [2025-03-17 19:52:39,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:39,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:39,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:39,795 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:39,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2025-03-17 19:52:39,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-17 19:52:39,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:52:39,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:39,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:39,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:52:39,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 309 proven. 10 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-03-17 19:52:39,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 65 proven. 53 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-03-17 19:52:40,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082700252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:40,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:40,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 10 [2025-03-17 19:52:40,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954349362] [2025-03-17 19:52:40,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:40,150 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:40,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash 605495146, now seen corresponding path program 7 times [2025-03-17 19:52:40,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:40,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601721961] [2025-03-17 19:52:40,150 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:40,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 19:52:40,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 19:52:40,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:40,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:40,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447674524] [2025-03-17 19:52:40,163 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:40,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:40,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:40,173 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:40,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2025-03-17 19:52:40,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 19:52:40,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 19:52:40,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:40,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:40,330 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:40,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 19:52:40,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 19:52:40,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:40,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:40,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:40,679 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:40,679 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:40,679 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:40,679 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:40,679 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:40,680 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:40,680 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:40,680 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:40,680 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2025-03-17 19:52:40,680 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:40,680 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:40,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,754 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:40,754 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:40,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:40,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:40,757 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) [2025-03-17 19:52:40,758 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 [2025-03-17 19:52:40,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:40,759 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:40,772 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:40,772 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=3} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:40,779 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 [2025-03-17 19:52:40,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:40,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:40,781 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) [2025-03-17 19:52:40,783 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 [2025-03-17 19:52:40,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:40,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:40,794 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:40,794 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: [] [2025-03-17 19:52:40,801 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 [2025-03-17 19:52:40,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:40,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:40,804 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) [2025-03-17 19:52:40,805 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 [2025-03-17 19:52:40,805 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:40,805 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:40,816 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:40,816 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: [] [2025-03-17 19:52:40,823 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 [2025-03-17 19:52:40,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:40,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:40,826 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) [2025-03-17 19:52:40,827 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 [2025-03-17 19:52:40,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:40,827 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:40,839 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:40,840 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=3} Honda state: {ULTIMATE.start_main_~n~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:40,847 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 [2025-03-17 19:52:40,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:40,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:40,850 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) [2025-03-17 19:52:40,850 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 [2025-03-17 19:52:40,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:40,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:40,862 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:40,862 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: [] [2025-03-17 19:52:40,867 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 [2025-03-17 19:52:40,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:40,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:40,870 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) [2025-03-17 19:52:40,871 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 [2025-03-17 19:52:40,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:40,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:40,891 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:40,891 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: [] [2025-03-17 19:52:40,897 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 [2025-03-17 19:52:40,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:40,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:40,899 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) [2025-03-17 19:52:40,900 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 [2025-03-17 19:52:40,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:40,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:40,918 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 [2025-03-17 19:52:40,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:40,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:40,920 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) [2025-03-17 19:52:40,921 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 [2025-03-17 19:52:40,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:40,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:40,945 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:40,949 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 [2025-03-17 19:52:40,950 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:40,950 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:40,950 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:40,950 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:40,950 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:40,950 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:40,950 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:40,950 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:40,950 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2025-03-17 19:52:40,950 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:40,950 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:40,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:40,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:41,017 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:41,017 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:41,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:41,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:41,019 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) [2025-03-17 19:52:41,020 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 [2025-03-17 19:52:41,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:41,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:41,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:41,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:41,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:41,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:41,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:41,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:41,034 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:41,040 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 [2025-03-17 19:52:41,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:41,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:41,044 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) [2025-03-17 19:52:41,045 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 [2025-03-17 19:52:41,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:41,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:41,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:41,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:41,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:41,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:41,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:41,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:41,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:41,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:41,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:41,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:41,066 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) [2025-03-17 19:52:41,067 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 [2025-03-17 19:52:41,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:41,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:41,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:41,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:41,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:41,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:41,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:41,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:41,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:41,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2025-03-17 19:52:41,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:41,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:41,090 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:41,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-03-17 19:52:41,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:41,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:41,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:41,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:41,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:41,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:41,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:41,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:41,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:41,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2025-03-17 19:52:41,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:41,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:41,113 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:41,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-03-17 19:52:41,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:41,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:41,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:41,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:41,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:41,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:41,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:41,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:41,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:41,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2025-03-17 19:52:41,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:41,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:41,134 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) [2025-03-17 19:52:41,135 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 [2025-03-17 19:52:41,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:41,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:41,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:41,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:41,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:41,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:41,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:41,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:41,147 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:41,153 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 [2025-03-17 19:52:41,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:41,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:41,155 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) [2025-03-17 19:52:41,156 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 [2025-03-17 19:52:41,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:41,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:41,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:41,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:41,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:41,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:41,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:41,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:41,168 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:41,173 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 [2025-03-17 19:52:41,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:41,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:41,175 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) [2025-03-17 19:52:41,176 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 [2025-03-17 19:52:41,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:41,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:41,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:41,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:41,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:41,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:41,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:41,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:41,190 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:41,191 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:41,192 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:41,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:41,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:41,194 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) [2025-03-17 19:52:41,194 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 [2025-03-17 19:52:41,195 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:41,195 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:41,195 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:41,195 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 [] [2025-03-17 19:52:41,202 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 [2025-03-17 19:52:41,203 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:41,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:41,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:52:41,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:52:41,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:41,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:41,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 19:52:41,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:41,356 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 [2025-03-17 19:52:41,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 19:52:41,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 19:52:41,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:41,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:41,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 19:52:41,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 38 proven. 118 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 19:52:41,969 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 15 loop predicates [2025-03-17 19:52:41,970 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1863 states and 2879 transitions. cyclomatic complexity: 1047 Second operand has 18 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 7 states have call successors, (13), 2 states have call predecessors, (13), 10 states have return successors, (18), 11 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-17 19:52:42,361 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1863 states and 2879 transitions. cyclomatic complexity: 1047. Second operand has 18 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 7 states have call successors, (13), 2 states have call predecessors, (13), 10 states have return successors, (18), 11 states have call predecessors, (18), 7 states have call successors, (18) Result 2399 states and 3597 transitions. Complement of second has 56 states. [2025-03-17 19:52:42,362 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 [2025-03-17 19:52:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 7 states have call successors, (13), 2 states have call predecessors, (13), 10 states have return successors, (18), 11 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-17 19:52:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2025-03-17 19:52:42,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 53 transitions. Stem has 105 letters. Loop has 62 letters. [2025-03-17 19:52:42,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:42,363 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:42,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:42,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:52:42,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:52:42,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:42,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:42,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 19:52:42,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:42,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 19:52:42,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 19:52:42,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:42,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:42,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 19:52:42,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 38 proven. 118 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 19:52:43,105 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 15 loop predicates [2025-03-17 19:52:43,106 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1863 states and 2879 transitions. cyclomatic complexity: 1047 Second operand has 18 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 7 states have call successors, (13), 2 states have call predecessors, (13), 10 states have return successors, (18), 11 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-17 19:52:43,449 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1863 states and 2879 transitions. cyclomatic complexity: 1047. Second operand has 18 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 7 states have call successors, (13), 2 states have call predecessors, (13), 10 states have return successors, (18), 11 states have call predecessors, (18), 7 states have call successors, (18) Result 2399 states and 3597 transitions. Complement of second has 56 states. [2025-03-17 19:52:43,449 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 [2025-03-17 19:52:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 7 states have call successors, (13), 2 states have call predecessors, (13), 10 states have return successors, (18), 11 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-17 19:52:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2025-03-17 19:52:43,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 53 transitions. Stem has 105 letters. Loop has 62 letters. [2025-03-17 19:52:43,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:43,450 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:43,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:43,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:52:43,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:52:43,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:43,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:43,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 19:52:43,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:43,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 19:52:43,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 19:52:43,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:43,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:43,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 19:52:43,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 38 proven. 118 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 19:52:44,256 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 15 loop predicates [2025-03-17 19:52:44,256 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1863 states and 2879 transitions. cyclomatic complexity: 1047 Second operand has 18 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 7 states have call successors, (13), 2 states have call predecessors, (13), 10 states have return successors, (18), 11 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-17 19:52:44,825 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1863 states and 2879 transitions. cyclomatic complexity: 1047. Second operand has 18 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 7 states have call successors, (13), 2 states have call predecessors, (13), 10 states have return successors, (18), 11 states have call predecessors, (18), 7 states have call successors, (18) Result 3961 states and 5976 transitions. Complement of second has 147 states. [2025-03-17 19:52:44,825 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 [2025-03-17 19:52:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 7 states have call successors, (13), 2 states have call predecessors, (13), 10 states have return successors, (18), 11 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-17 19:52:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 113 transitions. [2025-03-17 19:52:44,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 113 transitions. Stem has 105 letters. Loop has 62 letters. [2025-03-17 19:52:44,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:44,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 113 transitions. Stem has 167 letters. Loop has 62 letters. [2025-03-17 19:52:44,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:44,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 113 transitions. Stem has 105 letters. Loop has 124 letters. [2025-03-17 19:52:44,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:44,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3961 states and 5976 transitions. [2025-03-17 19:52:44,849 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 234 [2025-03-17 19:52:44,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3961 states to 2325 states and 3492 transitions. [2025-03-17 19:52:44,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2025-03-17 19:52:44,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 651 [2025-03-17 19:52:44,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2325 states and 3492 transitions. [2025-03-17 19:52:44,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:44,887 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2325 states and 3492 transitions. [2025-03-17 19:52:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states and 3492 transitions. [2025-03-17 19:52:44,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2189. [2025-03-17 19:52:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 1356 states have (on average 1.073008849557522) internal successors, (1455), 1339 states have internal predecessors, (1455), 554 states have call successors, (575), 266 states have call predecessors, (575), 279 states have return successors, (1244), 583 states have call predecessors, (1244), 554 states have call successors, (1244) [2025-03-17 19:52:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3274 transitions. [2025-03-17 19:52:44,921 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2189 states and 3274 transitions. [2025-03-17 19:52:44,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:44,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:52:44,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:52:44,921 INFO L87 Difference]: Start difference. First operand 2189 states and 3274 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-17 19:52:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:45,103 INFO L93 Difference]: Finished difference Result 2630 states and 4186 transitions. [2025-03-17 19:52:45,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2630 states and 4186 transitions. [2025-03-17 19:52:45,116 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 267 [2025-03-17 19:52:45,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2630 states to 2630 states and 4186 transitions. [2025-03-17 19:52:45,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 793 [2025-03-17 19:52:45,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 793 [2025-03-17 19:52:45,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2630 states and 4186 transitions. [2025-03-17 19:52:45,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:45,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2630 states and 4186 transitions. [2025-03-17 19:52:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states and 4186 transitions. [2025-03-17 19:52:45,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2193. [2025-03-17 19:52:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2193 states, 1359 states have (on average 1.0735835172921266) internal successors, (1459), 1343 states have internal predecessors, (1459), 555 states have call successors, (576), 266 states have call predecessors, (576), 279 states have return successors, (1246), 583 states have call predecessors, (1246), 555 states have call successors, (1246) [2025-03-17 19:52:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 3281 transitions. [2025-03-17 19:52:45,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2193 states and 3281 transitions. [2025-03-17 19:52:45,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:52:45,177 INFO L432 stractBuchiCegarLoop]: Abstraction has 2193 states and 3281 transitions. [2025-03-17 19:52:45,177 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-17 19:52:45,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2193 states and 3281 transitions. [2025-03-17 19:52:45,182 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 209 [2025-03-17 19:52:45,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:45,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:45,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [25, 25, 15, 10, 10, 10, 10, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-17 19:52:45,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 11, 11, 11, 11, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:45,186 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" [2025-03-17 19:52:45,186 INFO L754 eck$LassoCheckResult]: Loop: "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" [2025-03-17 19:52:45,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:45,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1793445124, now seen corresponding path program 9 times [2025-03-17 19:52:45,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:45,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735415244] [2025-03-17 19:52:45,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:45,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:45,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 165 statements into 12 equivalence classes. [2025-03-17 19:52:45,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 99 of 165 statements. [2025-03-17 19:52:45,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 19:52:45,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:45,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 164 proven. 60 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2025-03-17 19:52:45,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:45,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735415244] [2025-03-17 19:52:45,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735415244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:45,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994110195] [2025-03-17 19:52:45,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:45,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:45,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:45,305 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:45,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2025-03-17 19:52:45,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 165 statements into 12 equivalence classes. [2025-03-17 19:52:45,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 99 of 165 statements. [2025-03-17 19:52:45,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 19:52:45,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:45,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:52:45,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 630 proven. 43 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2025-03-17 19:52:45,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 188 proven. 101 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2025-03-17 19:52:45,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994110195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:45,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:45,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 19 [2025-03-17 19:52:45,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379155395] [2025-03-17 19:52:45,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:45,749 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:45,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:45,750 INFO L85 PathProgramCache]: Analyzing trace with hash 40727325, now seen corresponding path program 5 times [2025-03-17 19:52:45,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:45,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796441027] [2025-03-17 19:52:45,750 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:45,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:45,755 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 128 statements into 9 equivalence classes. [2025-03-17 19:52:45,759 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 118 of 128 statements. [2025-03-17 19:52:45,759 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-17 19:52:45,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 31 proven. 286 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2025-03-17 19:52:45,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:45,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796441027] [2025-03-17 19:52:45,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796441027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:45,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177574374] [2025-03-17 19:52:45,906 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:45,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:45,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:45,909 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:45,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2025-03-17 19:52:45,996 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 128 statements into 9 equivalence classes. [2025-03-17 19:52:46,016 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 118 of 128 statements. [2025-03-17 19:52:46,016 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-17 19:52:46,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:46,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 19:52:46,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 414 proven. 27 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2025-03-17 19:52:46,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 30 proven. 288 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2025-03-17 19:52:46,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177574374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:46,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:46,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 12] total 18 [2025-03-17 19:52:46,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984844258] [2025-03-17 19:52:46,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:46,295 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:46,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:46,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 19:52:46,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-17 19:52:46,295 INFO L87 Difference]: Start difference. First operand 2193 states and 3281 transitions. cyclomatic complexity: 1123 Second operand has 18 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 11 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-17 19:52:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:46,539 INFO L93 Difference]: Finished difference Result 2224 states and 3322 transitions. [2025-03-17 19:52:46,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2224 states and 3322 transitions. [2025-03-17 19:52:46,550 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 218 [2025-03-17 19:52:46,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2224 states to 2224 states and 3322 transitions. [2025-03-17 19:52:46,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 631 [2025-03-17 19:52:46,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 631 [2025-03-17 19:52:46,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2224 states and 3322 transitions. [2025-03-17 19:52:46,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:46,564 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2224 states and 3322 transitions. [2025-03-17 19:52:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states and 3322 transitions. [2025-03-17 19:52:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2179. [2025-03-17 19:52:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 1350 states have (on average 1.0718518518518518) internal successors, (1447), 1334 states have internal predecessors, (1447), 553 states have call successors, (573), 263 states have call predecessors, (573), 276 states have return successors, (1234), 581 states have call predecessors, (1234), 553 states have call successors, (1234) [2025-03-17 19:52:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3254 transitions. [2025-03-17 19:52:46,606 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2179 states and 3254 transitions. [2025-03-17 19:52:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:52:46,607 INFO L432 stractBuchiCegarLoop]: Abstraction has 2179 states and 3254 transitions. [2025-03-17 19:52:46,607 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-03-17 19:52:46,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2179 states and 3254 transitions. [2025-03-17 19:52:46,613 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 208 [2025-03-17 19:52:46,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:46,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:46,617 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [25, 25, 15, 10, 10, 10, 10, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-17 19:52:46,617 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [28, 28, 19, 19, 19, 19, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:46,617 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" [2025-03-17 19:52:46,618 INFO L754 eck$LassoCheckResult]: Loop: "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" [2025-03-17 19:52:46,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:46,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1793445124, now seen corresponding path program 10 times [2025-03-17 19:52:46,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:46,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036502676] [2025-03-17 19:52:46,618 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:46,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:46,625 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 165 statements into 2 equivalence classes. [2025-03-17 19:52:46,633 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 19:52:46,634 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:52:46,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 43 proven. 7 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2025-03-17 19:52:46,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:46,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036502676] [2025-03-17 19:52:46,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036502676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:46,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931742839] [2025-03-17 19:52:46,702 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:46,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:46,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:46,704 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:46,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2025-03-17 19:52:46,819 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 165 statements into 2 equivalence classes. [2025-03-17 19:52:46,865 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 19:52:46,865 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:52:46,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:46,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:52:46,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 675 proven. 1 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2025-03-17 19:52:46,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 67 proven. 49 refuted. 0 times theorem prover too weak. 1230 trivial. 0 not checked. [2025-03-17 19:52:47,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931742839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:47,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:47,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 10 [2025-03-17 19:52:47,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242762694] [2025-03-17 19:52:47,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:47,037 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:47,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:47,037 INFO L85 PathProgramCache]: Analyzing trace with hash 804573389, now seen corresponding path program 6 times [2025-03-17 19:52:47,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:47,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935612943] [2025-03-17 19:52:47,037 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:47,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:47,044 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 176 statements into 13 equivalence classes. [2025-03-17 19:52:47,061 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 164 of 176 statements. [2025-03-17 19:52:47,061 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-03-17 19:52:47,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 105 proven. 648 refuted. 0 times theorem prover too weak. 1118 trivial. 0 not checked. [2025-03-17 19:52:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935612943] [2025-03-17 19:52:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935612943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571201613] [2025-03-17 19:52:47,330 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:47,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:47,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:47,334 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:47,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2025-03-17 19:52:47,445 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 176 statements into 13 equivalence classes. [2025-03-17 19:52:47,489 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 164 of 176 statements. [2025-03-17 19:52:47,490 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-03-17 19:52:47,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:47,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 19:52:47,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 1047 proven. 128 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2025-03-17 19:52:47,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 103 proven. 660 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2025-03-17 19:52:48,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571201613] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:48,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:48,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 21] total 29 [2025-03-17 19:52:48,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354289171] [2025-03-17 19:52:48,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:48,156 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:48,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:48,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:52:48,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:52:48,157 INFO L87 Difference]: Start difference. First operand 2179 states and 3254 transitions. cyclomatic complexity: 1110 Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 4 states have call predecessors, (24), 5 states have call successors, (24) [2025-03-17 19:52:48,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:48,278 INFO L93 Difference]: Finished difference Result 1166 states and 1644 transitions. [2025-03-17 19:52:48,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1166 states and 1644 transitions. [2025-03-17 19:52:48,282 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 174 [2025-03-17 19:52:48,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1166 states to 1159 states and 1637 transitions. [2025-03-17 19:52:48,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 407 [2025-03-17 19:52:48,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 408 [2025-03-17 19:52:48,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1159 states and 1637 transitions. [2025-03-17 19:52:48,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:48,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1159 states and 1637 transitions. [2025-03-17 19:52:48,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states and 1637 transitions. [2025-03-17 19:52:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1142. [2025-03-17 19:52:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 721 states have (on average 1.0790568654646324) internal successors, (778), 708 states have internal predecessors, (778), 263 states have call successors, (270), 150 states have call predecessors, (270), 158 states have return successors, (572), 283 states have call predecessors, (572), 263 states have call successors, (572) [2025-03-17 19:52:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1620 transitions. [2025-03-17 19:52:48,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1142 states and 1620 transitions. [2025-03-17 19:52:48,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 19:52:48,304 INFO L432 stractBuchiCegarLoop]: Abstraction has 1142 states and 1620 transitions. [2025-03-17 19:52:48,304 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-03-17 19:52:48,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1142 states and 1620 transitions. [2025-03-17 19:52:48,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 162 [2025-03-17 19:52:48,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:48,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:48,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 23, 14, 9, 9, 9, 9, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:48,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 22, 13, 13, 13, 13, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:48,308 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" [2025-03-17 19:52:48,308 INFO L754 eck$LassoCheckResult]: Loop: "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" [2025-03-17 19:52:48,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:48,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1911319299, now seen corresponding path program 11 times [2025-03-17 19:52:48,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:48,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003907827] [2025-03-17 19:52:48,309 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:48,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:48,314 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 152 statements into 8 equivalence classes. [2025-03-17 19:52:48,326 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 19:52:48,326 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-17 19:52:48,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:48,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2025-03-17 19:52:48,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:48,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003907827] [2025-03-17 19:52:48,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003907827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:48,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306257192] [2025-03-17 19:52:48,471 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:48,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:48,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:48,474 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) [2025-03-17 19:52:48,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2025-03-17 19:52:48,572 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 152 statements into 8 equivalence classes. [2025-03-17 19:52:48,616 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 19:52:48,616 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-17 19:52:48,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:48,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:52:48,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 468 proven. 36 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2025-03-17 19:52:48,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 64 proven. 65 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2025-03-17 19:52:48,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306257192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:48,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:48,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 20 [2025-03-17 19:52:48,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97682752] [2025-03-17 19:52:48,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:48,845 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:48,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:48,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1669436435, now seen corresponding path program 7 times [2025-03-17 19:52:48,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:48,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396546165] [2025-03-17 19:52:48,845 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:48,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:48,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 19:52:48,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 19:52:48,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 130 proven. 56 refuted. 0 times theorem prover too weak. 911 trivial. 0 not checked. [2025-03-17 19:52:48,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:48,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396546165] [2025-03-17 19:52:48,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396546165] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:48,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612591079] [2025-03-17 19:52:48,934 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:48,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:48,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:48,956 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) [2025-03-17 19:52:48,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2025-03-17 19:52:49,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 19:52:49,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 19:52:49,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:49,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:49,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:52:49,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 672 proven. 105 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2025-03-17 19:52:49,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 124 proven. 325 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 19:52:49,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612591079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:49,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:49,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 17] total 25 [2025-03-17 19:52:49,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057551409] [2025-03-17 19:52:49,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:49,708 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:49,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:49,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 19:52:49,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2025-03-17 19:52:49,709 INFO L87 Difference]: Start difference. First operand 1142 states and 1620 transitions. cyclomatic complexity: 496 Second operand has 25 states, 21 states have (on average 3.238095238095238) internal successors, (68), 24 states have internal predecessors, (68), 16 states have call successors, (29), 2 states have call predecessors, (29), 8 states have return successors, (31), 11 states have call predecessors, (31), 16 states have call successors, (31) [2025-03-17 19:52:50,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:50,348 INFO L93 Difference]: Finished difference Result 1370 states and 2044 transitions. [2025-03-17 19:52:50,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1370 states and 2044 transitions. [2025-03-17 19:52:50,354 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 288 [2025-03-17 19:52:50,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1370 states to 1343 states and 2005 transitions. [2025-03-17 19:52:50,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 504 [2025-03-17 19:52:50,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 510 [2025-03-17 19:52:50,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1343 states and 2005 transitions. [2025-03-17 19:52:50,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:50,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1343 states and 2005 transitions. [2025-03-17 19:52:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states and 2005 transitions. [2025-03-17 19:52:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1197. [2025-03-17 19:52:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 759 states have (on average 1.077733860342556) internal successors, (818), 747 states have internal predecessors, (818), 280 states have call successors, (288), 155 states have call predecessors, (288), 158 states have return successors, (600), 294 states have call predecessors, (600), 280 states have call successors, (600) [2025-03-17 19:52:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1706 transitions. [2025-03-17 19:52:50,379 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1197 states and 1706 transitions. [2025-03-17 19:52:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 19:52:50,380 INFO L432 stractBuchiCegarLoop]: Abstraction has 1197 states and 1706 transitions. [2025-03-17 19:52:50,380 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-03-17 19:52:50,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1197 states and 1706 transitions. [2025-03-17 19:52:50,383 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 202 [2025-03-17 19:52:50,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:50,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:50,384 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 23, 14, 9, 9, 9, 9, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:50,384 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 18, 18, 18, 18, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:50,384 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" [2025-03-17 19:52:50,384 INFO L754 eck$LassoCheckResult]: Loop: "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" [2025-03-17 19:52:50,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:50,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1911319299, now seen corresponding path program 12 times [2025-03-17 19:52:50,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:50,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498946004] [2025-03-17 19:52:50,385 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:50,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:50,390 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 152 statements into 8 equivalence classes. [2025-03-17 19:52:50,399 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 135 of 152 statements. [2025-03-17 19:52:50,400 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-17 19:52:50,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2025-03-17 19:52:50,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:50,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498946004] [2025-03-17 19:52:50,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498946004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:50,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921551491] [2025-03-17 19:52:50,457 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:50,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:50,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:50,461 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) [2025-03-17 19:52:50,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2025-03-17 19:52:50,572 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 152 statements into 8 equivalence classes. [2025-03-17 19:52:50,608 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 135 of 152 statements. [2025-03-17 19:52:50,608 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-17 19:52:50,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:50,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:52:50,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 413 proven. 32 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-03-17 19:52:50,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2025-03-17 19:52:50,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921551491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:50,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:50,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2025-03-17 19:52:50,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545318136] [2025-03-17 19:52:50,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:50,874 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:50,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:50,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1398905060, now seen corresponding path program 8 times [2025-03-17 19:52:50,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:50,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782701420] [2025-03-17 19:52:50,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:50,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:50,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 190 statements into 2 equivalence classes. [2025-03-17 19:52:50,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 19:52:50,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:50,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 304 proven. 50 refuted. 0 times theorem prover too weak. 1729 trivial. 0 not checked. [2025-03-17 19:52:51,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:51,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782701420] [2025-03-17 19:52:51,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782701420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:51,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655100535] [2025-03-17 19:52:51,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:51,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:51,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:51,009 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:51,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Waiting until timeout for monitored process [2025-03-17 19:52:51,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 190 statements into 2 equivalence classes. [2025-03-17 19:52:51,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 19:52:51,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:51,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:51,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:52:51,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 1172 proven. 166 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2025-03-17 19:52:51,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 152 proven. 409 refuted. 0 times theorem prover too weak. 1522 trivial. 0 not checked. [2025-03-17 19:52:51,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655100535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:51,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:51,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 17] total 30 [2025-03-17 19:52:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786674575] [2025-03-17 19:52:51,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:51,681 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:51,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 19:52:51,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-17 19:52:51,682 INFO L87 Difference]: Start difference. First operand 1197 states and 1706 transitions. cyclomatic complexity: 527 Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 11 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 11 states have call predecessors, (33), 11 states have call successors, (33) [2025-03-17 19:52:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:52,009 INFO L93 Difference]: Finished difference Result 1615 states and 2684 transitions. [2025-03-17 19:52:52,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1615 states and 2684 transitions. [2025-03-17 19:52:52,016 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 343 [2025-03-17 19:52:52,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1615 states to 1591 states and 2650 transitions. [2025-03-17 19:52:52,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 587 [2025-03-17 19:52:52,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 587 [2025-03-17 19:52:52,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1591 states and 2650 transitions. [2025-03-17 19:52:52,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:52,027 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1591 states and 2650 transitions. [2025-03-17 19:52:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states and 2650 transitions. [2025-03-17 19:52:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1312. [2025-03-17 19:52:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 812 states have (on average 1.0714285714285714) internal successors, (870), 801 states have internal predecessors, (870), 342 states have call successors, (357), 155 states have call predecessors, (357), 158 states have return successors, (763), 355 states have call predecessors, (763), 342 states have call successors, (763) [2025-03-17 19:52:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1990 transitions. [2025-03-17 19:52:52,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1312 states and 1990 transitions. [2025-03-17 19:52:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 19:52:52,050 INFO L432 stractBuchiCegarLoop]: Abstraction has 1312 states and 1990 transitions. [2025-03-17 19:52:52,050 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-03-17 19:52:52,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1312 states and 1990 transitions. [2025-03-17 19:52:52,054 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 222 [2025-03-17 19:52:52,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:52,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:52,055 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [30, 30, 17, 13, 13, 13, 13, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 19:52:52,055 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [38, 38, 23, 23, 23, 23, 15, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2025-03-17 19:52:52,056 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" [2025-03-17 19:52:52,056 INFO L754 eck$LassoCheckResult]: Loop: "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" [2025-03-17 19:52:52,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:52,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1545436172, now seen corresponding path program 13 times [2025-03-17 19:52:52,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:52,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832118385] [2025-03-17 19:52:52,056 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:52,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:52,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 19:52:52,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 19:52:52,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:52,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1237462981] [2025-03-17 19:52:52,075 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:52,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:52,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:52,078 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:52,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2025-03-17 19:52:52,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 19:52:52,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 19:52:52,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:52,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:52,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 19:52:52,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 19:52:52,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:52,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:52,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:52,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1899741369, now seen corresponding path program 9 times [2025-03-17 19:52:52,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:52,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172623535] [2025-03-17 19:52:52,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:52,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:52,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 240 statements into 26 equivalence classes. [2025-03-17 19:52:52,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 135 of 240 statements. [2025-03-17 19:52:52,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-17 19:52:52,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3373 backedges. 629 proven. 80 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-17 19:52:52,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:52,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172623535] [2025-03-17 19:52:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172623535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:52,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914598069] [2025-03-17 19:52:52,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:52,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:52,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:52,565 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:52,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2025-03-17 19:52:52,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 240 statements into 26 equivalence classes. [2025-03-17 19:52:52,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 135 of 240 statements. [2025-03-17 19:52:52,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-17 19:52:52,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:52,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 19:52:52,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3373 backedges. 961 proven. 42 refuted. 0 times theorem prover too weak. 2370 trivial. 0 not checked. [2025-03-17 19:52:52,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3373 backedges. 629 proven. 85 refuted. 0 times theorem prover too weak. 2659 trivial. 0 not checked. [2025-03-17 19:52:53,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914598069] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:53,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:53,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 16] total 19 [2025-03-17 19:52:53,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175711765] [2025-03-17 19:52:53,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:53,220 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:53,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:53,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:52:53,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-03-17 19:52:53,220 INFO L87 Difference]: Start difference. First operand 1312 states and 1990 transitions. cyclomatic complexity: 700 Second operand has 19 states, 16 states have (on average 3.25) internal successors, (52), 19 states have internal predecessors, (52), 12 states have call successors, (22), 2 states have call predecessors, (22), 7 states have return successors, (23), 9 states have call predecessors, (23), 12 states have call successors, (23) [2025-03-17 19:52:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:53,731 INFO L93 Difference]: Finished difference Result 1535 states and 2549 transitions. [2025-03-17 19:52:53,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1535 states and 2549 transitions. [2025-03-17 19:52:53,738 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 280 [2025-03-17 19:52:53,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1535 states to 1473 states and 2442 transitions. [2025-03-17 19:52:53,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 546 [2025-03-17 19:52:53,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 546 [2025-03-17 19:52:53,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1473 states and 2442 transitions. [2025-03-17 19:52:53,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:53,746 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1473 states and 2442 transitions. [2025-03-17 19:52:53,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states and 2442 transitions. [2025-03-17 19:52:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1394. [2025-03-17 19:52:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 861 states have (on average 1.0685249709639955) internal successors, (920), 851 states have internal predecessors, (920), 375 states have call successors, (398), 157 states have call predecessors, (398), 158 states have return successors, (886), 385 states have call predecessors, (886), 375 states have call successors, (886) [2025-03-17 19:52:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2204 transitions. [2025-03-17 19:52:53,768 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1394 states and 2204 transitions. [2025-03-17 19:52:53,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 19:52:53,770 INFO L432 stractBuchiCegarLoop]: Abstraction has 1394 states and 2204 transitions. [2025-03-17 19:52:53,770 INFO L338 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-03-17 19:52:53,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1394 states and 2204 transitions. [2025-03-17 19:52:53,773 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 252 [2025-03-17 19:52:53,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:53,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:53,774 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 24, 12, 12, 12, 12, 12, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:53,774 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:53,774 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:53,774 INFO L754 eck$LassoCheckResult]: Loop: "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:53,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash 664776495, now seen corresponding path program 6 times [2025-03-17 19:52:53,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:53,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677300659] [2025-03-17 19:52:53,775 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:53,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:53,780 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 157 statements into 16 equivalence classes. [2025-03-17 19:52:53,798 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 19:52:53,798 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-03-17 19:52:53,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:53,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [772841289] [2025-03-17 19:52:53,800 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:53,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:53,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:53,802 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:53,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2025-03-17 19:52:53,920 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 157 statements into 16 equivalence classes. [2025-03-17 19:52:54,152 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 19:52:54,152 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-03-17 19:52:54,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:54,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:54,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 19:52:54,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 19:52:54,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:54,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:54,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:54,264 INFO L85 PathProgramCache]: Analyzing trace with hash 751762258, now seen corresponding path program 9 times [2025-03-17 19:52:54,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:54,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966948366] [2025-03-17 19:52:54,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:54,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:54,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 14 equivalence classes. [2025-03-17 19:52:54,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 19:52:54,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-17 19:52:54,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:54,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2041641581] [2025-03-17 19:52:54,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:54,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:54,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:54,279 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:54,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2025-03-17 19:52:54,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 14 equivalence classes. [2025-03-17 19:52:54,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 19:52:54,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-17 19:52:54,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:54,516 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:54,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 19:52:54,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 19:52:54,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:54,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:54,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:54,568 INFO L85 PathProgramCache]: Analyzing trace with hash 313455488, now seen corresponding path program 7 times [2025-03-17 19:52:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:54,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213007298] [2025-03-17 19:52:54,569 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:54,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:54,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 19:52:54,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 19:52:54,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:54,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [870890050] [2025-03-17 19:52:54,613 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:54,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:54,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:54,616 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:54,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2025-03-17 19:52:54,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 19:52:54,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 19:52:54,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:54,828 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:54,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 19:52:54,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 19:52:54,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:54,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:55,231 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:55,231 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:55,231 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:55,231 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:55,231 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:55,231 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,231 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:55,231 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:55,231 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration30_Loop [2025-03-17 19:52:55,231 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:55,231 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:55,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,274 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:55,274 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:55,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,276 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) [2025-03-17 19:52:55,277 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 [2025-03-17 19:52:55,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:55,278 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:55,289 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:55,289 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: [] [2025-03-17 19:52:55,295 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 [2025-03-17 19:52:55,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,297 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) [2025-03-17 19:52:55,298 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 [2025-03-17 19:52:55,299 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:55,299 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:55,309 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:55,309 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: [] [2025-03-17 19:52:55,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2025-03-17 19:52:55,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,317 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:55,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-03-17 19:52:55,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:55,318 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:55,330 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:55,330 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:55,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2025-03-17 19:52:55,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,338 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:55,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-03-17 19:52:55,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:55,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:55,350 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:55,350 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: [] [2025-03-17 19:52:55,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2025-03-17 19:52:55,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,358 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:55,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-03-17 19:52:55,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:55,360 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:55,370 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:55,370 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: [] [2025-03-17 19:52:55,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:55,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,379 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:55,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2025-03-17 19:52:55,380 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:55,380 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:55,390 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:55,391 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: [] [2025-03-17 19:52:55,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2025-03-17 19:52:55,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,398 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:55,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-03-17 19:52:55,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:55,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:55,410 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:55,410 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: [] [2025-03-17 19:52:55,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2025-03-17 19:52:55,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,418 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) [2025-03-17 19:52:55,419 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 [2025-03-17 19:52:55,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:55,420 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:55,437 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:55,437 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=5} Honda state: {ULTIMATE.start_main_~x~0#1=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:55,443 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 [2025-03-17 19:52:55,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,446 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) [2025-03-17 19:52:55,446 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 [2025-03-17 19:52:55,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:55,447 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:55,464 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 [2025-03-17 19:52:55,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,466 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) [2025-03-17 19:52:55,467 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 [2025-03-17 19:52:55,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:55,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:55,478 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:55,484 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 [2025-03-17 19:52:55,484 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:55,484 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:55,484 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:55,484 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:55,484 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:55,484 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,484 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:55,484 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:55,484 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration30_Loop [2025-03-17 19:52:55,484 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:55,484 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:55,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,536 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:55,536 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:55,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,541 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) [2025-03-17 19:52:55,542 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 [2025-03-17 19:52:55,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:55,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:55,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:55,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:55,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:55,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:55,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:55,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:55,554 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:55,559 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 [2025-03-17 19:52:55,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,562 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) [2025-03-17 19:52:55,562 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 [2025-03-17 19:52:55,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:55,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:55,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:55,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:55,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:55,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:55,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:55,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:55,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:55,579 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 [2025-03-17 19:52:55,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,581 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) [2025-03-17 19:52:55,584 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 [2025-03-17 19:52:55,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:55,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:55,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:55,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:55,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:55,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:55,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:55,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:55,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:55,604 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 [2025-03-17 19:52:55,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,606 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) [2025-03-17 19:52:55,607 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 [2025-03-17 19:52:55,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:55,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:55,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:55,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:55,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:55,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:55,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:55,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:55,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:55,627 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 [2025-03-17 19:52:55,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,651 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) [2025-03-17 19:52:55,652 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 [2025-03-17 19:52:55,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:55,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:55,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:55,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:55,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:55,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:55,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:55,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:55,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:55,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:55,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,671 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) [2025-03-17 19:52:55,672 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 [2025-03-17 19:52:55,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:55,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:55,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:55,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:55,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:55,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:55,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:55,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:55,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:55,688 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 [2025-03-17 19:52:55,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,690 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) [2025-03-17 19:52:55,691 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 [2025-03-17 19:52:55,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:55,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:55,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:55,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:55,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:55,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:55,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:55,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:55,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:55,710 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 [2025-03-17 19:52:55,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,712 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) [2025-03-17 19:52:55,713 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 [2025-03-17 19:52:55,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:55,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:55,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:55,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:55,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:55,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:55,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:55,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:55,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:55,730 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 [2025-03-17 19:52:55,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,770 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) [2025-03-17 19:52:55,773 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 [2025-03-17 19:52:55,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:55,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:55,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:55,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:55,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:55,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:55,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:55,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:55,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:55,790 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 [2025-03-17 19:52:55,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,792 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) [2025-03-17 19:52:55,793 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 [2025-03-17 19:52:55,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:55,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:55,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:55,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:55,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:55,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:55,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:55,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:55,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:55,813 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 [2025-03-17 19:52:55,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,815 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) [2025-03-17 19:52:55,816 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 [2025-03-17 19:52:55,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:55,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:55,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:55,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:55,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:55,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:55,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:55,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:55,829 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:55,830 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:55,830 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:55,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,832 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) [2025-03-17 19:52:55,833 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 [2025-03-17 19:52:55,834 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:55,834 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:55,834 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:55,834 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 [] [2025-03-17 19:52:55,839 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 [2025-03-17 19:52:55,840 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:55,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:55,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 19:52:55,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 19:52:55,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:55,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:55,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 19:52:55,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:56,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 19:52:56,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 19:52:56,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:56,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:56,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 19:52:56,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:56,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-17 19:52:56,862 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 [2025-03-17 19:52:56,862 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1394 states and 2204 transitions. cyclomatic complexity: 832 Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2025-03-17 19:52:57,096 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1394 states and 2204 transitions. cyclomatic complexity: 832. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) Result 2344 states and 3481 transitions. Complement of second has 77 states. [2025-03-17 19:52:57,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 15 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2025-03-17 19:52:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 64 transitions. [2025-03-17 19:52:57,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 64 transitions. Stem has 157 letters. Loop has 68 letters. [2025-03-17 19:52:57,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:57,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 64 transitions. Stem has 225 letters. Loop has 68 letters. [2025-03-17 19:52:57,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:57,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 64 transitions. Stem has 157 letters. Loop has 136 letters. [2025-03-17 19:52:57,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:57,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2344 states and 3481 transitions. [2025-03-17 19:52:57,112 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 252 [2025-03-17 19:52:57,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2344 states to 1724 states and 2673 transitions. [2025-03-17 19:52:57,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 511 [2025-03-17 19:52:57,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 513 [2025-03-17 19:52:57,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1724 states and 2673 transitions. [2025-03-17 19:52:57,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:57,124 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1724 states and 2673 transitions. [2025-03-17 19:52:57,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states and 2673 transitions. [2025-03-17 19:52:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1612. [2025-03-17 19:52:57,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 997 states have (on average 1.0722166499498496) internal successors, (1069), 987 states have internal predecessors, (1069), 415 states have call successors, (438), 177 states have call predecessors, (438), 200 states have return successors, (1008), 447 states have call predecessors, (1008), 415 states have call successors, (1008) [2025-03-17 19:52:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2515 transitions. [2025-03-17 19:52:57,159 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1612 states and 2515 transitions. [2025-03-17 19:52:57,159 INFO L432 stractBuchiCegarLoop]: Abstraction has 1612 states and 2515 transitions. [2025-03-17 19:52:57,159 INFO L338 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2025-03-17 19:52:57,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1612 states and 2515 transitions. [2025-03-17 19:52:57,164 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 252 [2025-03-17 19:52:57,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:57,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:57,165 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 24, 12, 12, 12, 12, 12, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:57,165 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 10, 10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:57,165 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:57,166 INFO L754 eck$LassoCheckResult]: Loop: "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:52:57,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:57,166 INFO L85 PathProgramCache]: Analyzing trace with hash 664776495, now seen corresponding path program 8 times [2025-03-17 19:52:57,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:57,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117621352] [2025-03-17 19:52:57,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:57,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:57,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes. [2025-03-17 19:52:57,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 19:52:57,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:57,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:57,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [998348318] [2025-03-17 19:52:57,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:57,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:57,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:57,186 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:57,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (182)] Waiting until timeout for monitored process [2025-03-17 19:52:57,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes. [2025-03-17 19:52:57,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 19:52:57,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:57,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:57,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:57,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 19:52:57,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 19:52:57,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:57,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:57,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:57,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:57,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1386405386, now seen corresponding path program 10 times [2025-03-17 19:52:57,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:57,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358347097] [2025-03-17 19:52:57,474 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:57,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:57,477 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-03-17 19:52:57,481 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 19:52:57,481 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:57,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:52:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326185691] [2025-03-17 19:52:57,481 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:57,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:57,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:57,484 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:57,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (183)] Waiting until timeout for monitored process [2025-03-17 19:52:57,588 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-03-17 19:52:57,638 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 19:52:57,638 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:57,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:57,638 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:57,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 19:53:00,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 19:53:00,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:00,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:00,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:00,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:00,335 INFO L85 PathProgramCache]: Analyzing trace with hash 735707448, now seen corresponding path program 9 times [2025-03-17 19:53:00,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:00,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616548666] [2025-03-17 19:53:00,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:53:00,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:00,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 237 statements into 21 equivalence classes. [2025-03-17 19:53:00,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 141 of 237 statements. [2025-03-17 19:53:00,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 19:53:00,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3191 backedges. 924 proven. 243 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2025-03-17 19:53:00,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:00,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616548666] [2025-03-17 19:53:00,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616548666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:00,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42347378] [2025-03-17 19:53:00,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:53:00,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:00,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:00,615 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:00,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (184)] Waiting until timeout for monitored process [2025-03-17 19:53:00,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 237 statements into 21 equivalence classes. [2025-03-17 19:53:00,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 141 of 237 statements. [2025-03-17 19:53:00,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 19:53:00,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:00,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 19:53:00,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3191 backedges. 921 proven. 243 refuted. 0 times theorem prover too weak. 2027 trivial. 0 not checked. [2025-03-17 19:53:00,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:01,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3191 backedges. 921 proven. 268 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2025-03-17 19:53:01,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42347378] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:01,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:01,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 24] total 30 [2025-03-17 19:53:01,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798668747] [2025-03-17 19:53:01,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:02,277 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:02,277 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:02,277 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:02,277 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:02,277 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:02,277 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:02,277 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:02,277 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:02,277 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration31_Loop [2025-03-17 19:53:02,277 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:02,277 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:02,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,324 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:02,324 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:02,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:02,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:02,331 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:02,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2025-03-17 19:53:02,332 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:02,332 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:02,345 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:02,345 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: [] [2025-03-17 19:53:02,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2025-03-17 19:53:02,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:02,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:02,414 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:02,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2025-03-17 19:53:02,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:02,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:02,427 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:02,427 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: [] [2025-03-17 19:53:02,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2025-03-17 19:53:02,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:02,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:02,434 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:02,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2025-03-17 19:53:02,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:02,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:02,445 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:02,446 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: [] [2025-03-17 19:53:02,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:02,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:02,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:02,453 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:02,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2025-03-17 19:53:02,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:02,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:02,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2025-03-17 19:53:02,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:02,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:02,472 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:02,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2025-03-17 19:53:02,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:02,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:02,485 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:02,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:02,491 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:02,491 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:02,491 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:02,491 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:02,491 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:02,491 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:02,491 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:02,491 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:02,491 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration31_Loop [2025-03-17 19:53:02,491 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:02,491 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:02,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:02,537 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:02,537 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:02,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:02,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:02,541 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:02,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-03-17 19:53:02,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:02,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:02,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:02,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:02,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:02,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:02,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:02,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:02,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:02,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2025-03-17 19:53:02,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:02,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:02,561 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:02,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2025-03-17 19:53:02,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:02,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:02,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:02,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:02,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:02,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:02,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:02,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:02,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:02,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2025-03-17 19:53:02,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:02,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:02,581 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:02,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2025-03-17 19:53:02,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:02,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:02,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:02,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:02,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:02,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:02,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:02,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:02,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:02,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2025-03-17 19:53:02,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:02,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:02,602 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:02,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2025-03-17 19:53:02,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:02,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:02,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:02,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:02,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:02,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:02,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:02,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:02,616 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:02,617 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:02,617 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:53:02,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:02,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:02,620 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) [2025-03-17 19:53:02,620 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 [2025-03-17 19:53:02,621 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:02,621 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:02,621 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:02,621 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 [] [2025-03-17 19:53:02,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2025-03-17 19:53:02,627 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:02,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:02,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 19:53:02,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 19:53:02,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:02,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:02,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 19:53:02,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:03,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 19:53:03,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 19:53:03,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:03,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:03,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 19:53:03,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-17 19:53:03,474 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 [2025-03-17 19:53:03,474 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1612 states and 2515 transitions. cyclomatic complexity: 929 Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-17 19:53:03,719 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1612 states and 2515 transitions. cyclomatic complexity: 929. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 3041 states and 4451 transitions. Complement of second has 89 states. [2025-03-17 19:53:03,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:03,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-17 19:53:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 70 transitions. [2025-03-17 19:53:03,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 70 transitions. Stem has 157 letters. Loop has 80 letters. [2025-03-17 19:53:03,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:03,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 70 transitions. Stem has 237 letters. Loop has 80 letters. [2025-03-17 19:53:03,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:03,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 70 transitions. Stem has 157 letters. Loop has 160 letters. [2025-03-17 19:53:03,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:03,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3041 states and 4451 transitions. [2025-03-17 19:53:03,759 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 252 [2025-03-17 19:53:03,760 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 [2025-03-17 19:53:03,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3041 states to 2086 states and 3178 transitions. [2025-03-17 19:53:03,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 517 [2025-03-17 19:53:03,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 519 [2025-03-17 19:53:03,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2086 states and 3178 transitions. [2025-03-17 19:53:03,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:03,772 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2086 states and 3178 transitions. [2025-03-17 19:53:03,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states and 3178 transitions. [2025-03-17 19:53:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 1856. [2025-03-17 19:53:03,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1148 states have (on average 1.0757839721254356) internal successors, (1235), 1138 states have internal predecessors, (1235), 460 states have call successors, (483), 199 states have call predecessors, (483), 248 states have return successors, (1158), 518 states have call predecessors, (1158), 460 states have call successors, (1158) [2025-03-17 19:53:03,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2876 transitions. [2025-03-17 19:53:03,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1856 states and 2876 transitions. [2025-03-17 19:53:03,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:03,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 19:53:03,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2025-03-17 19:53:03,809 INFO L87 Difference]: Start difference. First operand 1856 states and 2876 transitions. Second operand has 30 states, 25 states have (on average 2.92) internal successors, (73), 30 states have internal predecessors, (73), 16 states have call successors, (32), 1 states have call predecessors, (32), 10 states have return successors, (37), 16 states have call predecessors, (37), 16 states have call successors, (37) [2025-03-17 19:53:04,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:04,362 INFO L93 Difference]: Finished difference Result 2302 states and 3635 transitions. [2025-03-17 19:53:04,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2302 states and 3635 transitions. [2025-03-17 19:53:04,372 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 337 [2025-03-17 19:53:04,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2302 states to 2302 states and 3635 transitions. [2025-03-17 19:53:04,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 638 [2025-03-17 19:53:04,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 638 [2025-03-17 19:53:04,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2302 states and 3635 transitions. [2025-03-17 19:53:04,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:04,392 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2302 states and 3635 transitions. [2025-03-17 19:53:04,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states and 3635 transitions. [2025-03-17 19:53:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2060. [2025-03-17 19:53:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 1274 states have (on average 1.0902668759811618) internal successors, (1389), 1256 states have internal predecessors, (1389), 522 states have call successors, (545), 197 states have call predecessors, (545), 264 states have return successors, (1304), 606 states have call predecessors, (1304), 522 states have call successors, (1304) [2025-03-17 19:53:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 3238 transitions. [2025-03-17 19:53:04,437 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2060 states and 3238 transitions. [2025-03-17 19:53:04,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 19:53:04,437 INFO L432 stractBuchiCegarLoop]: Abstraction has 2060 states and 3238 transitions. [2025-03-17 19:53:04,438 INFO L338 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2025-03-17 19:53:04,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2060 states and 3238 transitions. [2025-03-17 19:53:04,443 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 284 [2025-03-17 19:53:04,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:04,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:04,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [26, 26, 14, 14, 14, 14, 12, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:53:04,445 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:53:04,445 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:53:04,445 INFO L754 eck$LassoCheckResult]: Loop: "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:53:04,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:04,445 INFO L85 PathProgramCache]: Analyzing trace with hash -753680913, now seen corresponding path program 10 times [2025-03-17 19:53:04,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:04,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172506214] [2025-03-17 19:53:04,446 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:53:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:04,454 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 169 statements into 2 equivalence classes. [2025-03-17 19:53:04,461 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 19:53:04,461 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:53:04,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 281 proven. 126 refuted. 0 times theorem prover too weak. 1112 trivial. 0 not checked. [2025-03-17 19:53:04,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:04,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172506214] [2025-03-17 19:53:04,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172506214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:04,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318192414] [2025-03-17 19:53:04,645 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:53:04,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:04,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:04,652 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:04,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (195)] Waiting until timeout for monitored process [2025-03-17 19:53:04,799 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 169 statements into 2 equivalence classes. [2025-03-17 19:53:04,827 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 19:53:04,827 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:53:04,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:04,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 19:53:04,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 767 proven. 37 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-03-17 19:53:04,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 281 proven. 130 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2025-03-17 19:53:05,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318192414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:05,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:05,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 15] total 19 [2025-03-17 19:53:05,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954454744] [2025-03-17 19:53:05,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:05,257 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:05,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:05,257 INFO L85 PathProgramCache]: Analyzing trace with hash -560156754, now seen corresponding path program 11 times [2025-03-17 19:53:05,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:05,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871991085] [2025-03-17 19:53:05,257 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:53:05,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:05,261 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 74 statements into 14 equivalence classes. [2025-03-17 19:53:05,264 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 19:53:05,264 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-17 19:53:05,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 78 proven. 156 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-17 19:53:05,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:05,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871991085] [2025-03-17 19:53:05,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871991085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:05,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603009478] [2025-03-17 19:53:05,448 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:53:05,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:05,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:05,451 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:05,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (196)] Waiting until timeout for monitored process [2025-03-17 19:53:05,601 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 74 statements into 14 equivalence classes. [2025-03-17 19:53:05,622 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 19:53:05,623 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-17 19:53:05,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:05,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 19:53:05,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 91 proven. 145 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-17 19:53:05,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 90 proven. 171 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-17 19:53:06,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603009478] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:06,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:06,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 21] total 30 [2025-03-17 19:53:06,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402961069] [2025-03-17 19:53:06,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:06,542 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:53:06,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:06,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 19:53:06,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2025-03-17 19:53:06,543 INFO L87 Difference]: Start difference. First operand 2060 states and 3238 transitions. cyclomatic complexity: 1208 Second operand has 30 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 17 states have call successors, (18), 1 states have call predecessors, (18), 11 states have return successors, (26), 17 states have call predecessors, (26), 17 states have call successors, (26) [2025-03-17 19:53:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:07,471 INFO L93 Difference]: Finished difference Result 2971 states and 5035 transitions. [2025-03-17 19:53:07,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2971 states and 5035 transitions. [2025-03-17 19:53:07,494 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 527 [2025-03-17 19:53:07,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2971 states to 2807 states and 4755 transitions. [2025-03-17 19:53:07,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 828 [2025-03-17 19:53:07,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 828 [2025-03-17 19:53:07,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2807 states and 4755 transitions. [2025-03-17 19:53:07,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:07,514 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2807 states and 4755 transitions. [2025-03-17 19:53:07,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states and 4755 transitions. [2025-03-17 19:53:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2104. [2025-03-17 19:53:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2104 states, 1297 states have (on average 1.0709329221279877) internal successors, (1389), 1278 states have internal predecessors, (1389), 552 states have call successors, (575), 248 states have call predecessors, (575), 255 states have return successors, (1494), 577 states have call predecessors, (1494), 552 states have call successors, (1494) [2025-03-17 19:53:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 3458 transitions. [2025-03-17 19:53:07,555 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2104 states and 3458 transitions. [2025-03-17 19:53:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-17 19:53:07,556 INFO L432 stractBuchiCegarLoop]: Abstraction has 2104 states and 3458 transitions. [2025-03-17 19:53:07,556 INFO L338 stractBuchiCegarLoop]: ======== Iteration 33 ============ [2025-03-17 19:53:07,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2104 states and 3458 transitions. [2025-03-17 19:53:07,561 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 302 [2025-03-17 19:53:07,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:07,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:07,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [40, 40, 21, 19, 19, 19, 19, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2025-03-17 19:53:07,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [49, 49, 34, 34, 34, 34, 15, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2025-03-17 19:53:07,563 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-17 19:53:07,563 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-17 19:53:07,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:07,564 INFO L85 PathProgramCache]: Analyzing trace with hash -876329479, now seen corresponding path program 14 times [2025-03-17 19:53:07,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:07,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936585029] [2025-03-17 19:53:07,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:07,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:07,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 261 statements into 2 equivalence classes. [2025-03-17 19:53:07,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 261 of 261 statements. [2025-03-17 19:53:07,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:53:07,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3586 backedges. 53 proven. 71 refuted. 0 times theorem prover too weak. 3462 trivial. 0 not checked. [2025-03-17 19:53:07,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:07,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936585029] [2025-03-17 19:53:07,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936585029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:07,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292683905] [2025-03-17 19:53:07,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:07,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:07,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:07,703 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:07,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (197)] Waiting until timeout for monitored process [2025-03-17 19:53:07,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 261 statements into 2 equivalence classes. [2025-03-17 19:53:07,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 261 of 261 statements. [2025-03-17 19:53:07,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:53:07,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:07,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:53:07,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3586 backedges. 1217 proven. 71 refuted. 0 times theorem prover too weak. 2298 trivial. 0 not checked. [2025-03-17 19:53:08,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3586 backedges. 53 proven. 71 refuted. 0 times theorem prover too weak. 3462 trivial. 0 not checked. [2025-03-17 19:53:08,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292683905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:08,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:08,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2025-03-17 19:53:08,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391626547] [2025-03-17 19:53:08,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:08,223 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:08,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1277101377, now seen corresponding path program 10 times [2025-03-17 19:53:08,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:08,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017391002] [2025-03-17 19:53:08,223 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:53:08,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:08,264 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 306 statements into 2 equivalence classes. [2025-03-17 19:53:08,276 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-17 19:53:08,276 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:53:08,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5881 backedges. 78 proven. 98 refuted. 0 times theorem prover too weak. 5705 trivial. 0 not checked. [2025-03-17 19:53:08,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:08,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017391002] [2025-03-17 19:53:08,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017391002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:08,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389958755] [2025-03-17 19:53:08,378 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:53:08,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:08,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,385 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (198)] Waiting until timeout for monitored process [2025-03-17 19:53:08,553 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 306 statements into 2 equivalence classes. [2025-03-17 19:53:08,603 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-17 19:53:08,603 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:53:08,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:08,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 19:53:08,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5881 backedges. 2303 proven. 170 refuted. 0 times theorem prover too weak. 3408 trivial. 0 not checked. [2025-03-17 19:53:08,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5881 backedges. 77 proven. 1426 refuted. 0 times theorem prover too weak. 4378 trivial. 0 not checked. [2025-03-17 19:53:09,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389958755] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:09,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:09,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 21] total 26 [2025-03-17 19:53:09,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367072100] [2025-03-17 19:53:09,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:09,435 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:53:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:09,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 19:53:09,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:53:09,436 INFO L87 Difference]: Start difference. First operand 2104 states and 3458 transitions. cyclomatic complexity: 1384 Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 11 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 11 states have call predecessors, (35), 11 states have call successors, (35) [2025-03-17 19:53:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:09,575 INFO L93 Difference]: Finished difference Result 2831 states and 5359 transitions. [2025-03-17 19:53:09,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2831 states and 5359 transitions. [2025-03-17 19:53:09,590 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 563 [2025-03-17 19:53:09,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2831 states to 2647 states and 4930 transitions. [2025-03-17 19:53:09,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 806 [2025-03-17 19:53:09,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 806 [2025-03-17 19:53:09,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2647 states and 4930 transitions. [2025-03-17 19:53:09,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:09,608 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2647 states and 4930 transitions. [2025-03-17 19:53:09,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states and 4930 transitions. [2025-03-17 19:53:09,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2124. [2025-03-17 19:53:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2124 states, 1311 states have (on average 1.0694126620900077) internal successors, (1402), 1291 states have internal predecessors, (1402), 558 states have call successors, (582), 248 states have call predecessors, (582), 255 states have return successors, (1502), 584 states have call predecessors, (1502), 558 states have call successors, (1502) [2025-03-17 19:53:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 3486 transitions. [2025-03-17 19:53:09,645 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2124 states and 3486 transitions. [2025-03-17 19:53:09,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:53:09,646 INFO L432 stractBuchiCegarLoop]: Abstraction has 2124 states and 3486 transitions. [2025-03-17 19:53:09,646 INFO L338 stractBuchiCegarLoop]: ======== Iteration 34 ============ [2025-03-17 19:53:09,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2124 states and 3486 transitions. [2025-03-17 19:53:09,650 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 302 [2025-03-17 19:53:09,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:09,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:09,651 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [34, 34, 19, 19, 19, 19, 15, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:53:09,651 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 12, 12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:53:09,651 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:53:09,651 INFO L754 eck$LassoCheckResult]: Loop: "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:53:09,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1030127588, now seen corresponding path program 11 times [2025-03-17 19:53:09,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089258554] [2025-03-17 19:53:09,652 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:53:09,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,658 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 219 statements into 21 equivalence classes. [2025-03-17 19:53:09,712 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 214 of 219 statements. [2025-03-17 19:53:09,712 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-03-17 19:53:09,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2651 backedges. 787 proven. 436 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2025-03-17 19:53:10,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:10,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089258554] [2025-03-17 19:53:10,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089258554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:10,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005921745] [2025-03-17 19:53:10,061 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:53:10,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:10,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,064 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (199)] Waiting until timeout for monitored process [2025-03-17 19:53:10,198 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 219 statements into 21 equivalence classes. [2025-03-17 19:53:10,533 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 214 of 219 statements. [2025-03-17 19:53:10,533 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-03-17 19:53:10,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2651 backedges. 1203 proven. 118 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2025-03-17 19:53:10,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2651 backedges. 413 proven. 247 refuted. 0 times theorem prover too weak. 1991 trivial. 0 not checked. [2025-03-17 19:53:11,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005921745] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:11,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:11,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 18] total 30 [2025-03-17 19:53:11,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056960563] [2025-03-17 19:53:11,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:11,140 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:11,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1238974930, now seen corresponding path program 12 times [2025-03-17 19:53:11,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:11,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927492566] [2025-03-17 19:53:11,140 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:53:11,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:11,144 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 92 statements into 19 equivalence classes. [2025-03-17 19:53:11,151 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 19:53:11,151 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2025-03-17 19:53:11,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:53:11,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [862831055] [2025-03-17 19:53:11,151 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:53:11,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:11,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:11,154 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) [2025-03-17 19:53:11,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (200)] Waiting until timeout for monitored process [2025-03-17 19:53:11,295 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 92 statements into 19 equivalence classes. [2025-03-17 19:53:11,842 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 19:53:11,843 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2025-03-17 19:53:11,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:11,843 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:11,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 19:53:11,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 19:53:11,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:11,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:12,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:12,357 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:12,357 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:12,357 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:12,357 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:12,357 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:12,357 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,357 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:12,357 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:12,357 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration34_Loop [2025-03-17 19:53:12,357 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:12,357 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:12,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,396 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:12,396 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:12,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,398 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2025-03-17 19:53:12,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,410 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:12,411 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: [] [2025-03-17 19:53:12,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2025-03-17 19:53:12,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,418 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2025-03-17 19:53:12,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,420 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,430 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:12,430 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:12,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:12,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,438 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2025-03-17 19:53:12,440 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,440 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,450 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:12,450 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: [] [2025-03-17 19:53:12,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2025-03-17 19:53:12,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,458 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2025-03-17 19:53:12,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,459 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,470 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:12,470 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: [] [2025-03-17 19:53:12,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0 [2025-03-17 19:53:12,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,477 INFO L229 MonitoredProcess]: Starting monitored process 205 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2025-03-17 19:53:12,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,488 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:12,488 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: [] [2025-03-17 19:53:12,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2025-03-17 19:53:12,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,496 INFO L229 MonitoredProcess]: Starting monitored process 206 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2025-03-17 19:53:12,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,508 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:12,508 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: [] [2025-03-17 19:53:12,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2025-03-17 19:53:12,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,516 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2025-03-17 19:53:12,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,528 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:12,528 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: [] [2025-03-17 19:53:12,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2025-03-17 19:53:12,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,537 INFO L229 MonitoredProcess]: Starting monitored process 208 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2025-03-17 19:53:12,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,548 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:12,548 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: [] [2025-03-17 19:53:12,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2025-03-17 19:53:12,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,560 INFO L229 MonitoredProcess]: Starting monitored process 209 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2025-03-17 19:53:12,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,561 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,572 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:12,572 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: [] [2025-03-17 19:53:12,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2025-03-17 19:53:12,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,579 INFO L229 MonitoredProcess]: Starting monitored process 210 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2025-03-17 19:53:12,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,581 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,599 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:12,599 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=7} Honda state: {ULTIMATE.start_main_~x~0#1=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:12,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2025-03-17 19:53:12,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,607 INFO L229 MonitoredProcess]: Starting monitored process 211 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2025-03-17 19:53:12,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,621 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:12,621 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: [] [2025-03-17 19:53:12,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Ended with exit code 0 [2025-03-17 19:53:12,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,630 INFO L229 MonitoredProcess]: Starting monitored process 212 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2025-03-17 19:53:12,631 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,631 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2025-03-17 19:53:12,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,656 INFO L229 MonitoredProcess]: Starting monitored process 213 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2025-03-17 19:53:12,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:12,658 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,669 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:12,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2025-03-17 19:53:12,675 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:12,676 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:12,676 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:12,676 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:12,676 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:12,676 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,676 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:12,676 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:12,676 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration34_Loop [2025-03-17 19:53:12,676 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:12,676 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:12,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,720 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:12,721 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:12,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,723 INFO L229 MonitoredProcess]: Starting monitored process 214 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2025-03-17 19:53:12,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:12,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:12,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,744 INFO L229 MonitoredProcess]: Starting monitored process 215 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2025-03-17 19:53:12,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:12,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Ended with exit code 0 [2025-03-17 19:53:12,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,764 INFO L229 MonitoredProcess]: Starting monitored process 216 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2025-03-17 19:53:12,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:12,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Ended with exit code 0 [2025-03-17 19:53:12,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,786 INFO L229 MonitoredProcess]: Starting monitored process 217 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2025-03-17 19:53:12,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:12,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Ended with exit code 0 [2025-03-17 19:53:12,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,806 INFO L229 MonitoredProcess]: Starting monitored process 218 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2025-03-17 19:53:12,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:12,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Ended with exit code 0 [2025-03-17 19:53:12,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,828 INFO L229 MonitoredProcess]: Starting monitored process 219 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2025-03-17 19:53:12,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:12,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:12,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,848 INFO L229 MonitoredProcess]: Starting monitored process 220 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2025-03-17 19:53:12,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,860 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:12,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Ended with exit code 0 [2025-03-17 19:53:12,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,869 INFO L229 MonitoredProcess]: Starting monitored process 221 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2025-03-17 19:53:12,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,881 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:12,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Ended with exit code 0 [2025-03-17 19:53:12,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,889 INFO L229 MonitoredProcess]: Starting monitored process 222 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2025-03-17 19:53:12,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:12,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Ended with exit code 0 [2025-03-17 19:53:12,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,910 INFO L229 MonitoredProcess]: Starting monitored process 223 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2025-03-17 19:53:12,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:12,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Ended with exit code 0 [2025-03-17 19:53:12,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,932 INFO L229 MonitoredProcess]: Starting monitored process 224 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2025-03-17 19:53:12,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,945 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:12,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Ended with exit code 0 [2025-03-17 19:53:12,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,953 INFO L229 MonitoredProcess]: Starting monitored process 225 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2025-03-17 19:53:12,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,966 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:12,967 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:12,968 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:53:12,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,971 INFO L229 MonitoredProcess]: Starting monitored process 226 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2025-03-17 19:53:12,971 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:12,971 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:12,971 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:12,971 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 [] [2025-03-17 19:53:12,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Ended with exit code 0 [2025-03-17 19:53:12,977 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:12,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:13,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 19:53:13,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 19:53:13,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:13,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:13,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-17 19:53:13,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:13,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:13,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 19:53:13,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 19:53:13,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:13,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:13,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 19:53:13,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-17 19:53:14,161 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 [2025-03-17 19:53:14,162 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2124 states and 3486 transitions. cyclomatic complexity: 1392 Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-17 19:53:14,498 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2124 states and 3486 transitions. cyclomatic complexity: 1392. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) Result 3920 states and 6091 transitions. Complement of second has 101 states. [2025-03-17 19:53:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 1 stem states 19 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-17 19:53:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 73 transitions. [2025-03-17 19:53:14,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 73 transitions. Stem has 219 letters. Loop has 92 letters. [2025-03-17 19:53:14,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:14,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 73 transitions. Stem has 311 letters. Loop has 92 letters. [2025-03-17 19:53:14,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:14,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 73 transitions. Stem has 219 letters. Loop has 184 letters. [2025-03-17 19:53:14,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:14,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3920 states and 6091 transitions. [2025-03-17 19:53:14,522 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 302 [2025-03-17 19:53:14,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3920 states to 2618 states and 4263 transitions. [2025-03-17 19:53:14,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 610 [2025-03-17 19:53:14,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 611 [2025-03-17 19:53:14,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2618 states and 4263 transitions. [2025-03-17 19:53:14,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:14,543 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2618 states and 4263 transitions. [2025-03-17 19:53:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states and 4263 transitions. [2025-03-17 19:53:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2434. [2025-03-17 19:53:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 1511 states have (on average 1.0701522170747848) internal successors, (1617), 1489 states have internal predecessors, (1617), 608 states have call successors, (632), 286 states have call predecessors, (632), 315 states have return successors, (1716), 658 states have call predecessors, (1716), 608 states have call successors, (1716) [2025-03-17 19:53:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3965 transitions. [2025-03-17 19:53:14,591 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2434 states and 3965 transitions. [2025-03-17 19:53:14,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:14,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 19:53:14,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2025-03-17 19:53:14,592 INFO L87 Difference]: Start difference. First operand 2434 states and 3965 transitions. Second operand has 30 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 28 states have internal predecessors, (81), 19 states have call successors, (35), 2 states have call predecessors, (35), 10 states have return successors, (39), 15 states have call predecessors, (39), 19 states have call successors, (39) [2025-03-17 19:53:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:15,892 INFO L93 Difference]: Finished difference Result 2719 states and 4391 transitions. [2025-03-17 19:53:15,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2719 states and 4391 transitions. [2025-03-17 19:53:15,902 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 361 [2025-03-17 19:53:15,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2719 states to 2253 states and 3655 transitions. [2025-03-17 19:53:15,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 700 [2025-03-17 19:53:15,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 700 [2025-03-17 19:53:15,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2253 states and 3655 transitions. [2025-03-17 19:53:15,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:15,914 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2253 states and 3655 transitions. [2025-03-17 19:53:15,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states and 3655 transitions. [2025-03-17 19:53:15,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2021. [2025-03-17 19:53:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2021 states, 1269 states have (on average 1.0520094562647755) internal successors, (1335), 1248 states have internal predecessors, (1335), 505 states have call successors, (529), 264 states have call predecessors, (529), 247 states have return successors, (1420), 508 states have call predecessors, (1420), 505 states have call successors, (1420) [2025-03-17 19:53:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 3284 transitions. [2025-03-17 19:53:15,943 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2021 states and 3284 transitions. [2025-03-17 19:53:15,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 19:53:15,943 INFO L432 stractBuchiCegarLoop]: Abstraction has 2021 states and 3284 transitions. [2025-03-17 19:53:15,943 INFO L338 stractBuchiCegarLoop]: ======== Iteration 35 ============ [2025-03-17 19:53:15,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2021 states and 3284 transitions. [2025-03-17 19:53:15,947 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 280 [2025-03-17 19:53:15,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:15,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:15,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [35, 35, 20, 20, 20, 20, 15, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:53:15,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 16, 13, 13, 13, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:53:15,948 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "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;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#47#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#45#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#43#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:53:15,948 INFO L754 eck$LassoCheckResult]: Loop: "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;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#53#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#51#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#41#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#49#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "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;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-17 19:53:15,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:15,949 INFO L85 PathProgramCache]: Analyzing trace with hash 313455488, now seen corresponding path program 12 times [2025-03-17 19:53:15,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:15,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768403088] [2025-03-17 19:53:15,949 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:53:15,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:15,956 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 225 statements into 21 equivalence classes. [2025-03-17 19:53:15,980 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 19:53:15,980 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-03-17 19:53:15,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:53:15,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1482617607] [2025-03-17 19:53:15,981 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:53:15,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:15,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:15,984 INFO L229 MonitoredProcess]: Starting monitored process 227 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:15,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (227)] Waiting until timeout for monitored process [2025-03-17 19:53:16,141 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 225 statements into 21 equivalence classes. [2025-03-17 19:53:16,474 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 19:53:16,475 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-03-17 19:53:16,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:16,475 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:16,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 19:53:16,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 19:53:16,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:16,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:16,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:16,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:16,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1442702546, now seen corresponding path program 13 times [2025-03-17 19:53:16,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:16,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548466744] [2025-03-17 19:53:16,586 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:53:16,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:16,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 19:53:16,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 19:53:16,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:16,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 107 proven. 345 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-17 19:53:16,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:16,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548466744] [2025-03-17 19:53:16,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548466744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:16,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630676483] [2025-03-17 19:53:16,857 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:53:16,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:16,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:16,859 INFO L229 MonitoredProcess]: Starting monitored process 228 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:16,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (228)] Waiting until timeout for monitored process [2025-03-17 19:53:17,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 19:53:17,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 19:53:17,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:17,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:17,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 19:53:17,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 101 proven. 334 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-03-17 19:53:17,107 INFO L312 TraceCheckSpWp]: Computing backward predicates...