./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 e2fb8bed 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-?-e2fb8be-m [2025-03-09 06:49:12,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:49:12,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:49:12,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:49:12,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:49:12,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:49:12,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:49:12,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:49:12,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:49:12,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:49:12,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:49:12,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:49:12,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:49:12,319 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:49:12,320 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:49:12,320 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:49:12,320 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:49:12,320 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:49:12,320 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:49:12,320 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:49:12,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:49:12,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:49:12,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:49:12,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:49:12,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:49:12,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:49:12,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:49:12,320 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:49:12,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:49:12,321 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:49:12,321 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:49:12,321 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:49:12,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:49:12,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:49:12,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:49:12,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:49:12,322 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:49:12,322 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-09 06:49:12,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:49:12,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:49:12,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:49:12,553 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:49:12,553 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:49:12,554 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-09 06:49:13,688 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23f8e6db6/53eee4736fc744ab95f9da8e80d5ef16/FLAG35a68fc60 [2025-03-09 06:49:13,894 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:49:13,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2025-03-09 06:49:13,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23f8e6db6/53eee4736fc744ab95f9da8e80d5ef16/FLAG35a68fc60 [2025-03-09 06:49:13,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23f8e6db6/53eee4736fc744ab95f9da8e80d5ef16 [2025-03-09 06:49:13,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:49:13,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:49:13,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:49:13,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:49:13,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:49:13,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:49:13" (1/1) ... [2025-03-09 06:49:13,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e5a164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:13, skipping insertion in model container [2025-03-09 06:49:13,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:49:13" (1/1) ... [2025-03-09 06:49:13,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:49:14,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:49:14,039 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:49:14,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:49:14,056 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:49:14,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:14 WrapperNode [2025-03-09 06:49:14,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:49:14,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:49:14,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:49:14,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:49:14,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:14" (1/1) ... [2025-03-09 06:49:14,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:14" (1/1) ... [2025-03-09 06:49:14,073 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-03-09 06:49:14,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:49:14,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:49:14,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:49:14,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:49:14,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:14" (1/1) ... [2025-03-09 06:49:14,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:14" (1/1) ... [2025-03-09 06:49:14,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:14" (1/1) ... [2025-03-09 06:49:14,082 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 06:49:14,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:14" (1/1) ... [2025-03-09 06:49:14,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:14" (1/1) ... [2025-03-09 06:49:14,083 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:14" (1/1) ... [2025-03-09 06:49:14,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:14" (1/1) ... [2025-03-09 06:49:14,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:14" (1/1) ... [2025-03-09 06:49:14,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:14" (1/1) ... [2025-03-09 06:49:14,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:49:14,086 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:49:14,086 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:49:14,086 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:49:14,087 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:14" (1/1) ... [2025-03-09 06:49:14,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:14,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:14,109 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-09 06:49:14,112 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-09 06:49:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2025-03-09 06:49:14,129 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2025-03-09 06:49:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:49:14,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:49:14,163 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:49:14,164 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:49:14,280 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30: havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; [2025-03-09 06:49:14,280 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30-6: havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; [2025-03-09 06:49:14,293 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-09 06:49:14,296 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:49:14,302 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:49:14,303 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:49:14,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:14 BoogieIcfgContainer [2025-03-09 06:49:14,304 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:49:14,305 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:49:14,305 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:49:14,310 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:49:14,310 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:14,311 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:49:13" (1/3) ... [2025-03-09 06:49:14,312 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1751398d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:49:14, skipping insertion in model container [2025-03-09 06:49:14,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:14,312 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:14" (2/3) ... [2025-03-09 06:49:14,313 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1751398d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:49:14, skipping insertion in model container [2025-03-09 06:49:14,313 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:14,313 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:14" (3/3) ... [2025-03-09 06:49:14,315 INFO L363 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2025-03-09 06:49:14,357 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:49:14,357 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:49:14,358 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:49:14,358 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:49:14,358 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:49:14,358 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:49:14,359 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:49:14,359 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:49:14,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 18 states have (on average 1.3333333333333333) 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-09 06:49:14,378 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2025-03-09 06:49:14,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:14,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:14,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:49:14,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:49:14,382 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:49:14,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 18 states have (on average 1.3333333333333333) 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-09 06:49:14,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2025-03-09 06:49:14,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:14,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:14,386 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:49:14,386 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:49:14,390 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-09 06:49:14,390 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-09 06:49:14,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2123067, now seen corresponding path program 1 times [2025-03-09 06:49:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:14,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674539177] [2025-03-09 06:49:14,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:14,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:14,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:14,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:14,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:14,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:14,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:14,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:14,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:14,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:14,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:14,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1806, now seen corresponding path program 1 times [2025-03-09 06:49:14,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:14,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023498021] [2025-03-09 06:49:14,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:14,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:14,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:14,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:14,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:14,474 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:14,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:14,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:14,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:14,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:14,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:14,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2040268232, now seen corresponding path program 1 times [2025-03-09 06:49:14,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:14,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035375268] [2025-03-09 06:49:14,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:14,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:14,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:49:14,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:49:14,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:14,541 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-09 06:49:14,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:14,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035375268] [2025-03-09 06:49:14,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035375268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:14,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:14,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:49:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788605147] [2025-03-09 06:49:14,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:14,580 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:14,581 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:14,581 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:14,581 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:14,581 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:14,581 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:14,581 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:14,581 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:14,581 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2025-03-09 06:49:14,581 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:14,581 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:14,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:14,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:14,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:14,650 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:14,651 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:14,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:14,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:14,655 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-09 06:49:14,656 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-09 06:49:14,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:14,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:14,671 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:14,671 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-09 06:49:14,678 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-09 06:49:14,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:14,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:14,680 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-09 06:49:14,682 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-09 06:49:14,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:14,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:14,695 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:14,695 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-09 06:49:14,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:14,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:14,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:14,703 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-09 06:49:14,704 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-09 06:49:14,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:14,707 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:14,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-09 06:49:14,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:14,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:14,726 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-09 06:49:14,726 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-09 06:49:14,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:14,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:14,791 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:14,795 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-09 06:49:14,795 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:14,795 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:14,795 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:14,795 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:14,795 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:14,796 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:14,796 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:14,796 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:14,796 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2025-03-09 06:49:14,796 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:14,796 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:14,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:14,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:14,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:14,838 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:14,841 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:14,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:14,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:14,845 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-09 06:49:14,847 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-09 06:49:14,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:14,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:14,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:14,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:14,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:14,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:14,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:14,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:14,868 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:14,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:14,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:14,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:14,877 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-09 06:49:14,878 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-09 06:49:14,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-09 06:49:14,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:14,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:14,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:14,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:14,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:14,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:14,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:14,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:14,896 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-09 06:49:14,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:14,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:14,898 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-09 06:49:14,900 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-09 06:49:14,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:14,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:14,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:14,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:14,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:14,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:14,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:14,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:14,915 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:14,919 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 06:49:14,921 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-09 06:49:14,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:14,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:14,925 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-09 06:49:14,927 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-09 06:49:14,928 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:14,928 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:14,928 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:14,928 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-09 06:49:14,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-09 06:49:14,937 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:14,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:14,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:14,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:14,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:14,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:14,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:14,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:14,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:14,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:14,980 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:49:14,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:15,010 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-09 06:49:15,031 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-09 06:49:15,033 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 18 states have (on average 1.3333333333333333) 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 06:49:15,088 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 18 states have (on average 1.3333333333333333) 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). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 41 states and 58 transitions. Complement of second has 5 states. [2025-03-09 06:49:15,089 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-09 06:49:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 06:49:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-03-09 06:49:15,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-09 06:49:15,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:15,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-09 06:49:15,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:15,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-09 06:49:15,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:15,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2025-03-09 06:49:15,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2025-03-09 06:49:15,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 31 states and 45 transitions. [2025-03-09 06:49:15,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-03-09 06:49:15,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-03-09 06:49:15,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2025-03-09 06:49:15,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:15,110 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2025-03-09 06:49:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2025-03-09 06:49:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-03-09 06:49:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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-09 06:49:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2025-03-09 06:49:15,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-03-09 06:49:15,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:15,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:49:15,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:49:15,134 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-09 06:49:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:15,189 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2025-03-09 06:49:15,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2025-03-09 06:49:15,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-03-09 06:49:15,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 36 transitions. [2025-03-09 06:49:15,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-09 06:49:15,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-09 06:49:15,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2025-03-09 06:49:15,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:49:15,192 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-03-09 06:49:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2025-03-09 06:49:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-09 06:49:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-09 06:49:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-09 06:49:15,196 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-09 06:49:15,197 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-09 06:49:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:49:15,198 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-09 06:49:15,198 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:49:15,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2025-03-09 06:49:15,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-03-09 06:49:15,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:15,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:15,200 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:49:15,200 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:15,200 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-09 06:49:15,201 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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-09 06:49:15,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2123067, now seen corresponding path program 2 times [2025-03-09 06:49:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:15,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932733358] [2025-03-09 06:49:15,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:15,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:15,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:15,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:49:15,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:15,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:15,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:15,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:15,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:15,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:15,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:15,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:15,209 INFO L85 PathProgramCache]: Analyzing trace with hash 114375069, now seen corresponding path program 1 times [2025-03-09 06:49:15,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:15,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677479705] [2025-03-09 06:49:15,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:15,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:15,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:49:15,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:49:15,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:15,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:15,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980031705] [2025-03-09 06:49:15,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:15,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:15,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:15,230 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-09 06:49:15,232 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-09 06:49:15,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:49:15,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:49:15,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:15,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:15,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:15,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:49:15,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:49:15,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:15,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:15,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:15,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:15,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1885038761, now seen corresponding path program 1 times [2025-03-09 06:49:15,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:15,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948839692] [2025-03-09 06:49:15,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:15,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:15,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 06:49:15,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:49:15,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:15,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:15,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [873604728] [2025-03-09 06:49:15,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:15,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:15,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:15,307 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-09 06:49:15,308 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-09 06:49:15,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 06:49:15,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:49:15,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:15,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:15,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:15,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 06:49:15,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:49:15,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:15,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:15,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:15,595 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:15,595 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:15,595 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:15,595 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:15,595 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:15,595 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:15,595 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:15,595 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:15,595 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2025-03-09 06:49:15,595 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:15,595 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:15,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,665 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:15,666 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:15,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:15,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:15,668 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-09 06:49:15,670 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-09 06:49:15,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:15,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:15,682 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:15,683 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-09 06:49:15,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:15,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:15,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:15,691 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-09 06:49:15,691 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-09 06:49:15,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:15,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:15,704 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:15,704 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-09 06:49:15,710 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-09 06:49:15,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:15,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:15,712 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-09 06:49:15,712 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-09 06:49:15,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:15,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:15,724 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:15,724 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-09 06:49:15,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:15,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:15,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:15,732 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-09 06:49:15,734 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-09 06:49:15,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:15,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:15,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-09 06:49:15,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:15,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:15,753 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-09 06:49:15,754 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-09 06:49:15,755 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:15,755 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:15,767 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:15,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:15,773 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:15,773 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:15,773 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:15,773 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:15,773 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:15,773 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:15,773 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:15,773 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:15,774 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2025-03-09 06:49:15,774 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:15,774 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:15,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,859 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:15,860 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:15,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:15,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:15,863 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-09 06:49:15,865 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-09 06:49:15,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:15,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:15,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:15,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:15,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:15,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:15,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:15,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:15,877 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:15,883 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-09 06:49:15,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:15,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:15,885 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-09 06:49:15,886 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-09 06:49:15,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:15,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:15,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:15,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:15,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:15,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:15,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:15,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:15,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:15,907 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-09 06:49:15,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:15,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:15,909 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-09 06:49:15,910 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-09 06:49:15,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:15,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:15,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:15,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:15,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:15,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:15,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:15,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:15,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:15,930 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-09 06:49:15,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:15,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:15,933 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-09 06:49:15,935 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-09 06:49:15,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:15,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:15,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:15,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:15,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:15,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:15,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:15,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:15,948 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:15,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:15,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:15,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:15,956 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-09 06:49:15,957 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-09 06:49:15,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:15,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:15,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:15,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:15,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:15,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:15,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:15,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:15,972 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:15,974 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:15,974 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:15,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:15,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:15,978 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-09 06:49:15,979 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-09 06:49:15,979 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:15,979 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:15,979 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:15,979 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-09 06:49:15,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-09 06:49:15,987 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:15,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:16,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:16,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:16,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:16,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:16,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:16,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:16,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:49:16,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:49:16,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:16,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:16,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:49:16,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:16,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:16,180 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-09 06:49:16,180 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-09 06:49:16,181 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 11 Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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-09 06:49:16,406 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 11. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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 111 states and 174 transitions. Complement of second has 28 states. [2025-03-09 06:49:16,407 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-09 06:49:16,408 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), 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-09 06:49:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2025-03-09 06:49:16,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 4 letters. Loop has 22 letters. [2025-03-09 06:49:16,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:16,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 26 letters. Loop has 22 letters. [2025-03-09 06:49:16,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:16,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 4 letters. Loop has 44 letters. [2025-03-09 06:49:16,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:16,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 174 transitions. [2025-03-09 06:49:16,412 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2025-03-09 06:49:16,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 111 states and 174 transitions. [2025-03-09 06:49:16,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2025-03-09 06:49:16,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-03-09 06:49:16,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 174 transitions. [2025-03-09 06:49:16,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:16,415 INFO L218 hiAutomatonCegarLoop]: Abstraction has 111 states and 174 transitions. [2025-03-09 06:49:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 174 transitions. [2025-03-09 06:49:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2025-03-09 06:49:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 64 states have (on average 1.234375) internal successors, (79), 65 states have internal predecessors, (79), 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-09 06:49:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2025-03-09 06:49:16,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 151 transitions. [2025-03-09 06:49:16,423 INFO L432 stractBuchiCegarLoop]: Abstraction has 102 states and 151 transitions. [2025-03-09 06:49:16,423 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:49:16,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 151 transitions. [2025-03-09 06:49:16,424 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2025-03-09 06:49:16,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:16,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:16,425 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:49:16,425 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:16,425 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-09 06:49:16,425 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#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-09 06:49:16,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:16,425 INFO L85 PathProgramCache]: Analyzing trace with hash 65815104, now seen corresponding path program 1 times [2025-03-09 06:49:16,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:16,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086911671] [2025-03-09 06:49:16,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:16,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:16,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:16,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:16,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:16,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:16,428 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:16,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:16,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:16,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:16,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:16,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:16,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:16,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1761412171, now seen corresponding path program 1 times [2025-03-09 06:49:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:16,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714169914] [2025-03-09 06:49:16,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:16,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:16,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 06:49:16,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 06:49:16,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:16,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-09 06:49:16,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:16,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714169914] [2025-03-09 06:49:16,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714169914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:16,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:16,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:49:16,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835508691] [2025-03-09 06:49:16,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:16,529 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:16,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:16,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:49:16,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:49:16,530 INFO L87 Difference]: Start difference. First operand 102 states and 151 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-09 06:49:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:16,565 INFO L93 Difference]: Finished difference Result 141 states and 212 transitions. [2025-03-09 06:49:16,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 212 transitions. [2025-03-09 06:49:16,567 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 49 [2025-03-09 06:49:16,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 138 states and 209 transitions. [2025-03-09 06:49:16,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2025-03-09 06:49:16,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2025-03-09 06:49:16,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 209 transitions. [2025-03-09 06:49:16,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:16,572 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 209 transitions. [2025-03-09 06:49:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 209 transitions. [2025-03-09 06:49:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2025-03-09 06:49:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 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-09 06:49:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-03-09 06:49:16,580 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-03-09 06:49:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:49:16,582 INFO L432 stractBuchiCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-03-09 06:49:16,582 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:49:16,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 155 transitions. [2025-03-09 06:49:16,584 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2025-03-09 06:49:16,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:16,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:16,585 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:49:16,585 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-09 06:49:16,585 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-09 06:49:16,585 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#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-09 06:49:16,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash 65815104, now seen corresponding path program 2 times [2025-03-09 06:49:16,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:16,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631450915] [2025-03-09 06:49:16,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:16,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:16,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:16,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:16,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:49:16,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:16,593 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:16,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:16,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:16,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:16,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:16,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:16,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:16,595 INFO L85 PathProgramCache]: Analyzing trace with hash 743731512, now seen corresponding path program 1 times [2025-03-09 06:49:16,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:16,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996516119] [2025-03-09 06:49:16,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:16,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 06:49:16,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:49:16,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:16,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:16,832 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-09 06:49:16,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:16,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996516119] [2025-03-09 06:49:16,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996516119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:16,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218946202] [2025-03-09 06:49:16,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:16,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:16,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:16,834 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-09 06:49:16,836 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-09 06:49:16,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 06:49:16,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:49:16,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:16,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:16,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:49:16,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:16,914 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-09 06:49:16,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:17,135 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-09 06:49:17,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218946202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:17,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:17,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 10] total 19 [2025-03-09 06:49:17,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418077776] [2025-03-09 06:49:17,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:17,136 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:17,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:17,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:49:17,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:49:17,137 INFO L87 Difference]: Start difference. First operand 106 states and 155 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-09 06:49:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:17,445 INFO L93 Difference]: Finished difference Result 228 states and 371 transitions. [2025-03-09 06:49:17,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 228 states and 371 transitions. [2025-03-09 06:49:17,448 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 76 [2025-03-09 06:49:17,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 228 states to 228 states and 371 transitions. [2025-03-09 06:49:17,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-03-09 06:49:17,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2025-03-09 06:49:17,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 228 states and 371 transitions. [2025-03-09 06:49:17,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:17,452 INFO L218 hiAutomatonCegarLoop]: Abstraction has 228 states and 371 transitions. [2025-03-09 06:49:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states and 371 transitions. [2025-03-09 06:49:17,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 150. [2025-03-09 06:49:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 89 states have internal predecessors, (103), 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-09 06:49:17,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 265 transitions. [2025-03-09 06:49:17,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 150 states and 265 transitions. [2025-03-09 06:49:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 06:49:17,474 INFO L432 stractBuchiCegarLoop]: Abstraction has 150 states and 265 transitions. [2025-03-09 06:49:17,474 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:49:17,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 265 transitions. [2025-03-09 06:49:17,475 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2025-03-09 06:49:17,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:17,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:17,476 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:49:17,476 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-09 06:49:17,476 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-09 06:49:17,476 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#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-09 06:49:17,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash 65815104, now seen corresponding path program 3 times [2025-03-09 06:49:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:17,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928772326] [2025-03-09 06:49:17,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:17,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:17,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:17,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:49:17,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:17,483 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:17,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:17,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:17,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:17,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:17,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:17,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:17,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1578924882, now seen corresponding path program 2 times [2025-03-09 06:49:17,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:17,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954336273] [2025-03-09 06:49:17,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:17,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:17,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-09 06:49:17,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 06:49:17,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:17,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:17,693 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-09 06:49:17,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:17,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954336273] [2025-03-09 06:49:17,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954336273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:17,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558386770] [2025-03-09 06:49:17,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:17,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:17,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,697 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-09 06:49:17,698 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-09 06:49:17,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-09 06:49:17,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 06:49:17,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:17,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:17,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 06:49:17,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:17,800 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-09 06:49:17,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:18,184 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-09 06:49:18,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558386770] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:18,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:18,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 19 [2025-03-09 06:49:18,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642303575] [2025-03-09 06:49:18,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:18,186 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:18,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:18,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:49:18,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:49:18,187 INFO L87 Difference]: Start difference. First operand 150 states and 265 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-09 06:49:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:18,473 INFO L93 Difference]: Finished difference Result 286 states and 517 transitions. [2025-03-09 06:49:18,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 517 transitions. [2025-03-09 06:49:18,476 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 88 [2025-03-09 06:49:18,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 286 states and 517 transitions. [2025-03-09 06:49:18,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2025-03-09 06:49:18,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 144 [2025-03-09 06:49:18,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 517 transitions. [2025-03-09 06:49:18,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:18,481 INFO L218 hiAutomatonCegarLoop]: Abstraction has 286 states and 517 transitions. [2025-03-09 06:49:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 517 transitions. [2025-03-09 06:49:18,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 176. [2025-03-09 06:49:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 100 states have (on average 1.15) internal successors, (115), 101 states have internal predecessors, (115), 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-09 06:49:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 355 transitions. [2025-03-09 06:49:18,499 INFO L240 hiAutomatonCegarLoop]: Abstraction has 176 states and 355 transitions. [2025-03-09 06:49:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 06:49:18,500 INFO L432 stractBuchiCegarLoop]: Abstraction has 176 states and 355 transitions. [2025-03-09 06:49:18,501 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:49:18,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 355 transitions. [2025-03-09 06:49:18,503 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2025-03-09 06:49:18,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:18,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:18,503 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:49:18,503 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-09 06:49:18,504 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-09 06:49:18,504 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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-09 06:49:18,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:18,504 INFO L85 PathProgramCache]: Analyzing trace with hash 65815104, now seen corresponding path program 4 times [2025-03-09 06:49:18,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:18,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665057695] [2025-03-09 06:49:18,504 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:18,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:18,506 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-03-09 06:49:18,507 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:18,507 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:18,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:18,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:18,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:18,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:18,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:18,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:18,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:18,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:18,509 INFO L85 PathProgramCache]: Analyzing trace with hash -864320788, now seen corresponding path program 3 times [2025-03-09 06:49:18,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:18,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609173200] [2025-03-09 06:49:18,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:18,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:18,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 10 equivalence classes. [2025-03-09 06:49:18,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 44 of 50 statements. [2025-03-09 06:49:18,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-09 06:49:18,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 15 proven. 78 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-09 06:49:18,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:18,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609173200] [2025-03-09 06:49:18,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609173200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:18,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964765645] [2025-03-09 06:49:18,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:18,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:18,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:18,675 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-09 06:49:18,677 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-09 06:49:18,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 10 equivalence classes. [2025-03-09 06:49:18,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 44 of 50 statements. [2025-03-09 06:49:18,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-09 06:49:18,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:18,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 06:49:18,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 43 proven. 60 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-09 06:49:18,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 15 proven. 86 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 06:49:19,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964765645] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:19,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:19,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 16] total 21 [2025-03-09 06:49:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137197784] [2025-03-09 06:49:19,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:19,242 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:19,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:19,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 06:49:19,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-03-09 06:49:19,243 INFO L87 Difference]: Start difference. First operand 176 states and 355 transitions. cyclomatic complexity: 184 Second operand has 21 states, 16 states have (on average 2.625) internal successors, (42), 19 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 8 states have return successors, (16), 8 states have call predecessors, (16), 13 states have call successors, (16) [2025-03-09 06:49:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:19,714 INFO L93 Difference]: Finished difference Result 228 states and 443 transitions. [2025-03-09 06:49:19,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 228 states and 443 transitions. [2025-03-09 06:49:19,717 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2025-03-09 06:49:19,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 228 states to 228 states and 443 transitions. [2025-03-09 06:49:19,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-03-09 06:49:19,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2025-03-09 06:49:19,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 228 states and 443 transitions. [2025-03-09 06:49:19,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:19,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 228 states and 443 transitions. [2025-03-09 06:49:19,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states and 443 transitions. [2025-03-09 06:49:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 198. [2025-03-09 06:49:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 115 states have internal predecessors, (137), 60 states have call successors, (60), 18 states have call predecessors, (60), 22 states have return successors, (180), 64 states have call predecessors, (180), 60 states have call successors, (180) [2025-03-09 06:49:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 377 transitions. [2025-03-09 06:49:19,742 INFO L240 hiAutomatonCegarLoop]: Abstraction has 198 states and 377 transitions. [2025-03-09 06:49:19,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 06:49:19,744 INFO L432 stractBuchiCegarLoop]: Abstraction has 198 states and 377 transitions. [2025-03-09 06:49:19,744 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 06:49:19,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 377 transitions. [2025-03-09 06:49:19,746 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2025-03-09 06:49:19,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:19,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:19,747 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:49:19,747 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-09 06:49:19,747 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-09 06:49:19,747 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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-09 06:49:19,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:19,748 INFO L85 PathProgramCache]: Analyzing trace with hash 65815104, now seen corresponding path program 5 times [2025-03-09 06:49:19,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:19,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011333397] [2025-03-09 06:49:19,748 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:19,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:19,751 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:19,753 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:19,753 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:49:19,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:19,753 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:19,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:19,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:19,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:19,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:19,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:19,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:19,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1289941038, now seen corresponding path program 4 times [2025-03-09 06:49:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:19,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733438001] [2025-03-09 06:49:19,758 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:19,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:19,765 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-09 06:49:19,769 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:49:19,770 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:19,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:19,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107265812] [2025-03-09 06:49:19,770 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:19,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:19,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:19,776 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-09 06:49:19,777 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-09 06:49:19,804 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-09 06:49:19,813 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:49:19,813 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:19,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:19,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:19,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:49:19,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:49:19,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:19,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:19,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:19,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:19,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1650944495, now seen corresponding path program 1 times [2025-03-09 06:49:19,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:19,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390081547] [2025-03-09 06:49:19,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:19,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:19,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 06:49:19,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 06:49:19,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:19,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:19,901 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-09 06:49:19,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:19,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390081547] [2025-03-09 06:49:19,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390081547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:19,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793694553] [2025-03-09 06:49:19,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:19,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:19,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:19,903 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-09 06:49:19,905 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-09 06:49:19,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 06:49:19,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 06:49:19,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:19,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:19,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:49:19,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:19,970 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-09 06:49:19,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:20,023 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-09 06:49:20,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793694553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:20,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:20,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2025-03-09 06:49:20,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969550374] [2025-03-09 06:49:20,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:20,214 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:20,215 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:20,215 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:20,215 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:20,215 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:20,215 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,215 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:20,215 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:20,215 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2025-03-09 06:49:20,215 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:20,215 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:20,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,292 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:20,292 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:20,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,294 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-09 06:49:20,296 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-09 06:49:20,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:20,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:20,308 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:20,308 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-09 06:49:20,313 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-09 06:49:20,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,316 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-09 06:49:20,316 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-09 06:49:20,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:20,317 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:20,327 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:20,327 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-09 06:49:20,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 06:49:20,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,334 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-09 06:49:20,336 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-09 06:49:20,336 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:20,336 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:20,346 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:20,347 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-09 06:49:20,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-09 06:49:20,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,354 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-09 06:49:20,355 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-09 06:49:20,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:20,355 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:20,366 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:20,366 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-09 06:49:20,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 06:49:20,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,373 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-09 06:49:20,374 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-09 06:49:20,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:20,375 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:20,385 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:20,385 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-09 06:49:20,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-09 06:49:20,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,393 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-09 06:49:20,393 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-09 06:49:20,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:20,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:20,410 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-09 06:49:20,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,413 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-09 06:49:20,414 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-09 06:49:20,418 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:20,418 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:20,433 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:20,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-09 06:49:20,440 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:20,440 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:20,440 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:20,440 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:20,440 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:20,440 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,440 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:20,440 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:20,440 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2025-03-09 06:49:20,440 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:20,440 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:20,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,504 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:20,504 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:20,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,508 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-09 06:49:20,508 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-09 06:49:20,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:20,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:20,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:20,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:20,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:20,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:20,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:20,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:20,525 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:20,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:20,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,532 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-09 06:49:20,533 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-09 06:49:20,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:20,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:20,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:20,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:20,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:20,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:20,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:20,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:20,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:20,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-09 06:49:20,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,558 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-09 06:49:20,559 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-09 06:49:20,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:20,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:20,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:20,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:20,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:20,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:20,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:20,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:20,572 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:20,578 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-09 06:49:20,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,580 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-09 06:49:20,580 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-09 06:49:20,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:20,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:20,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:20,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:20,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:20,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:20,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:20,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:20,592 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:20,598 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-09 06:49:20,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,601 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-09 06:49:20,601 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-09 06:49:20,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:20,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:20,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:20,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:20,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:20,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:20,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:20,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:20,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:20,620 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-09 06:49:20,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,622 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-09 06:49:20,623 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-09 06:49:20,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:20,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:20,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:20,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:20,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:20,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:20,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:20,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:20,637 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:20,639 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:20,639 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:20,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,642 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-09 06:49:20,644 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-09 06:49:20,645 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:20,645 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:20,645 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:20,646 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 3 Supporting invariants [] [2025-03-09 06:49:20,654 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-09 06:49:20,655 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:20,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:20,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:20,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:20,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:20,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:20,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:20,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:49:20,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:49:20,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:20,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:49:20,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-09 06:49:20,837 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2025-03-09 06:49:20,837 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 198 states and 377 transitions. cyclomatic complexity: 184 Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-09 06:49:21,058 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 198 states and 377 transitions. cyclomatic complexity: 184. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Result 819 states and 1459 transitions. Complement of second has 41 states. [2025-03-09 06:49:21,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2025-03-09 06:49:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-09 06:49:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2025-03-09 06:49:21,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 71 transitions. Stem has 5 letters. Loop has 32 letters. [2025-03-09 06:49:21,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:21,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 71 transitions. Stem has 37 letters. Loop has 32 letters. [2025-03-09 06:49:21,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:21,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 71 transitions. Stem has 5 letters. Loop has 64 letters. [2025-03-09 06:49:21,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:21,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 819 states and 1459 transitions. [2025-03-09 06:49:21,074 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 83 [2025-03-09 06:49:21,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 819 states to 718 states and 1285 transitions. [2025-03-09 06:49:21,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2025-03-09 06:49:21,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 216 [2025-03-09 06:49:21,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 718 states and 1285 transitions. [2025-03-09 06:49:21,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:21,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 718 states and 1285 transitions. [2025-03-09 06:49:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states and 1285 transitions. [2025-03-09 06:49:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 686. [2025-03-09 06:49:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 406 states have (on average 1.187192118226601) internal successors, (482), 397 states have internal predecessors, (482), 201 states have call successors, (201), 68 states have call predecessors, (201), 79 states have return successors, (554), 220 states have call predecessors, (554), 198 states have call successors, (554) [2025-03-09 06:49:21,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1237 transitions. [2025-03-09 06:49:21,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 686 states and 1237 transitions. [2025-03-09 06:49:21,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:21,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:49:21,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:49:21,120 INFO L87 Difference]: Start difference. First operand 686 states and 1237 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-09 06:49:21,201 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-09 06:49:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:21,223 INFO L93 Difference]: Finished difference Result 619 states and 1039 transitions. [2025-03-09 06:49:21,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 619 states and 1039 transitions. [2025-03-09 06:49:21,229 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 67 [2025-03-09 06:49:21,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 619 states to 617 states and 1035 transitions. [2025-03-09 06:49:21,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2025-03-09 06:49:21,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2025-03-09 06:49:21,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 617 states and 1035 transitions. [2025-03-09 06:49:21,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:21,237 INFO L218 hiAutomatonCegarLoop]: Abstraction has 617 states and 1035 transitions. [2025-03-09 06:49:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states and 1035 transitions. [2025-03-09 06:49:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2025-03-09 06:49:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 377 states have (on average 1.193633952254642) internal successors, (450), 376 states have internal predecessors, (450), 161 states have call successors, (161), 68 states have call predecessors, (161), 79 states have return successors, (424), 172 states have call predecessors, (424), 158 states have call successors, (424) [2025-03-09 06:49:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1035 transitions. [2025-03-09 06:49:21,258 INFO L240 hiAutomatonCegarLoop]: Abstraction has 617 states and 1035 transitions. [2025-03-09 06:49:21,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:49:21,259 INFO L432 stractBuchiCegarLoop]: Abstraction has 617 states and 1035 transitions. [2025-03-09 06:49:21,260 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 06:49:21,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 617 states and 1035 transitions. [2025-03-09 06:49:21,263 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 67 [2025-03-09 06:49:21,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:21,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:21,265 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:49:21,265 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-09 06:49:21,266 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-09 06:49:21,266 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:21,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:21,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2040268250, now seen corresponding path program 1 times [2025-03-09 06:49:21,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:21,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114386900] [2025-03-09 06:49:21,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:21,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:21,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:49:21,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:49:21,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:21,269 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:21,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:49:21,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:49:21,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:21,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:21,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:21,272 INFO L85 PathProgramCache]: Analyzing trace with hash -80638444, now seen corresponding path program 1 times [2025-03-09 06:49:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:21,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574599760] [2025-03-09 06:49:21,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:21,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:21,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:49:21,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:49:21,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:21,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548439444] [2025-03-09 06:49:21,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:21,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:21,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,287 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-09 06:49:21,288 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-09 06:49:21,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:49:21,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:49:21,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:21,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:21,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:49:21,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:49:21,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:21,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:21,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:21,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1327566227, now seen corresponding path program 1 times [2025-03-09 06:49:21,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:21,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096102692] [2025-03-09 06:49:21,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:21,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:21,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 06:49:21,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 06:49:21,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:21,395 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-09 06:49:21,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:21,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096102692] [2025-03-09 06:49:21,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096102692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:21,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:21,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:49:21,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399921218] [2025-03-09 06:49:21,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:21,635 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:21,635 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:21,635 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:21,635 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:21,635 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:21,635 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,635 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:21,635 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:21,635 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration8_Loop [2025-03-09 06:49:21,635 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:21,635 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:21,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,693 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:21,693 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:21,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,695 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:21,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-09 06:49:21,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:21,697 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:21,708 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:21,709 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-09 06:49:21,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-09 06:49:21,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,716 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-09 06:49:21,719 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-09 06:49:21,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:21,721 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:21,744 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-09 06:49:21,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,747 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-09 06:49:21,747 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-09 06:49:21,749 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:21,749 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:21,761 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:21,767 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-09 06:49:21,768 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:21,768 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:21,768 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:21,768 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:21,768 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:21,768 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,768 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:21,768 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:21,768 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration8_Loop [2025-03-09 06:49:21,768 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:21,768 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:21,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,824 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:21,824 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:21,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,828 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-09 06:49:21,829 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-09 06:49:21,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-09 06:49:21,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:21,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:21,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:21,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:21,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:21,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:21,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:21,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:21,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-09 06:49:21,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,850 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-09 06:49:21,852 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-09 06:49:21,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:21,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:21,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:21,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:21,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:21,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:21,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:21,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:21,866 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:21,870 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:21,870 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:21,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,872 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-09 06:49:21,874 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-09 06:49:21,875 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:21,875 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:21,875 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:21,875 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-09 06:49:21,881 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-09 06:49:21,881 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:21,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:21,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:49:21,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:49:21,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:21,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:21,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:21,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:49:21,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:21,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:49:21,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:21,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:49:21,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:22,121 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-09 06:49:22,122 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-09 06:49:22,122 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 617 states and 1035 transitions. cyclomatic complexity: 435 Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 06:49:22,357 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 617 states and 1035 transitions. cyclomatic complexity: 435. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 1384 states and 2175 transitions. Complement of second has 53 states. [2025-03-09 06:49:22,358 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-09 06:49:22,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 06:49:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2025-03-09 06:49:22,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 70 transitions. Stem has 6 letters. Loop has 44 letters. [2025-03-09 06:49:22,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:22,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 70 transitions. Stem has 50 letters. Loop has 44 letters. [2025-03-09 06:49:22,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:22,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 70 transitions. Stem has 6 letters. Loop has 88 letters. [2025-03-09 06:49:22,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:22,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1384 states and 2175 transitions. [2025-03-09 06:49:22,374 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 63 [2025-03-09 06:49:22,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1384 states to 948 states and 1500 transitions. [2025-03-09 06:49:22,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 203 [2025-03-09 06:49:22,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2025-03-09 06:49:22,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 948 states and 1500 transitions. [2025-03-09 06:49:22,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:22,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 948 states and 1500 transitions. [2025-03-09 06:49:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states and 1500 transitions. [2025-03-09 06:49:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 861. [2025-03-09 06:49:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 537 states have (on average 1.1936685288640596) internal successors, (641), 538 states have internal predecessors, (641), 198 states have call successors, (198), 85 states have call predecessors, (198), 126 states have return successors, (522), 237 states have call predecessors, (522), 194 states have call successors, (522) [2025-03-09 06:49:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1361 transitions. [2025-03-09 06:49:22,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 861 states and 1361 transitions. [2025-03-09 06:49:22,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:22,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:49:22,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:49:22,420 INFO L87 Difference]: Start difference. First operand 861 states and 1361 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 06:49:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:22,454 INFO L93 Difference]: Finished difference Result 645 states and 1001 transitions. [2025-03-09 06:49:22,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 645 states and 1001 transitions. [2025-03-09 06:49:22,460 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 58 [2025-03-09 06:49:22,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 645 states to 615 states and 969 transitions. [2025-03-09 06:49:22,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2025-03-09 06:49:22,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2025-03-09 06:49:22,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 615 states and 969 transitions. [2025-03-09 06:49:22,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:22,466 INFO L218 hiAutomatonCegarLoop]: Abstraction has 615 states and 969 transitions. [2025-03-09 06:49:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states and 969 transitions. [2025-03-09 06:49:22,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 612. [2025-03-09 06:49:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 381 states have (on average 1.178477690288714) internal successors, (449), 383 states have internal predecessors, (449), 144 states have call successors, (144), 64 states have call predecessors, (144), 87 states have return successors, (373), 164 states have call predecessors, (373), 140 states have call successors, (373) [2025-03-09 06:49:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 966 transitions. [2025-03-09 06:49:22,482 INFO L240 hiAutomatonCegarLoop]: Abstraction has 612 states and 966 transitions. [2025-03-09 06:49:22,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:49:22,483 INFO L432 stractBuchiCegarLoop]: Abstraction has 612 states and 966 transitions. [2025-03-09 06:49:22,483 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 06:49:22,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 612 states and 966 transitions. [2025-03-09 06:49:22,486 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 57 [2025-03-09 06:49:22,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:22,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:22,487 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:22,487 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:49:22,487 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-09 06:49:22,487 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< [2025-03-09 06:49:22,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:22,487 INFO L85 PathProgramCache]: Analyzing trace with hash 623152882, now seen corresponding path program 1 times [2025-03-09 06:49:22,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:22,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719295854] [2025-03-09 06:49:22,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:22,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:22,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:49:22,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:49:22,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:22,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:22,519 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-09 06:49:22,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:22,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719295854] [2025-03-09 06:49:22,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719295854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:22,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:22,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:49:22,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106422075] [2025-03-09 06:49:22,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:22,520 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:22,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:22,520 INFO L85 PathProgramCache]: Analyzing trace with hash 33769, now seen corresponding path program 1 times [2025-03-09 06:49:22,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:22,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546775509] [2025-03-09 06:49:22,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:22,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:22,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:22,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:22,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:22,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:22,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:22,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:22,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:22,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:22,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:22,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:22,564 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:22,564 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:22,564 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:22,564 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:22,564 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:22,564 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:22,564 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:22,564 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:22,564 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration9_Loop [2025-03-09 06:49:22,564 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:22,564 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:22,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:22,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:22,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:22,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:22,587 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:22,587 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:22,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:22,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:22,589 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-09 06:49:22,591 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-09 06:49:22,592 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:22,592 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:22,603 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:22,603 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-09 06:49:22,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:22,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:22,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:22,613 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-09 06:49:22,615 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-09 06:49:22,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:22,616 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:22,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-09 06:49:22,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:22,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:22,636 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-09 06:49:22,637 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-09 06:49:22,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:22,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:22,660 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:22,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-09 06:49:22,665 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:22,665 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:22,665 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:22,665 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:22,665 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:22,665 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:22,665 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:22,665 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:22,665 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration9_Loop [2025-03-09 06:49:22,666 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:22,666 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:22,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:22,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:22,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:22,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:22,691 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:22,691 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:22,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:22,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:22,693 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-09 06:49:22,694 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-09 06:49:22,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:22,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:22,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:22,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:22,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:22,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:22,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:22,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:22,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:22,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-09 06:49:22,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:22,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:22,714 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-09 06:49:22,714 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-09 06:49:22,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:22,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:22,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:22,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:22,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:22,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:22,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:22,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:22,728 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:22,730 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:22,730 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:49:22,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:22,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:22,732 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-09 06:49:22,734 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-09 06:49:22,736 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:22,736 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:22,736 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:22,736 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2025-03-09 06:49:22,743 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-09 06:49:22,743 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:22,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:22,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:49:22,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:49:22,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:22,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:22,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:49:22,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:22,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:22,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:22,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:22,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:22,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:49:22,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:22,814 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-09 06:49:22,815 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-09 06:49:22,815 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 612 states and 966 transitions. cyclomatic complexity: 371 Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:22,855 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 612 states and 966 transitions. cyclomatic complexity: 371. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 943 states and 1517 transitions. Complement of second has 17 states. [2025-03-09 06:49:22,856 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-09 06:49:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2025-03-09 06:49:22,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 11 letters. Loop has 3 letters. [2025-03-09 06:49:22,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:22,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-09 06:49:22,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:22,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 11 letters. Loop has 6 letters. [2025-03-09 06:49:22,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:22,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 943 states and 1517 transitions. [2025-03-09 06:49:22,868 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 70 [2025-03-09 06:49:22,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 943 states to 852 states and 1406 transitions. [2025-03-09 06:49:22,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2025-03-09 06:49:22,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 216 [2025-03-09 06:49:22,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 852 states and 1406 transitions. [2025-03-09 06:49:22,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:22,880 INFO L218 hiAutomatonCegarLoop]: Abstraction has 852 states and 1406 transitions. [2025-03-09 06:49:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states and 1406 transitions. [2025-03-09 06:49:22,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 830. [2025-03-09 06:49:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 521 states have (on average 1.2072936660268714) internal successors, (629), 538 states have internal predecessors, (629), 202 states have call successors, (202), 103 states have call predecessors, (202), 107 states have return successors, (532), 188 states have call predecessors, (532), 198 states have call successors, (532) [2025-03-09 06:49:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1363 transitions. [2025-03-09 06:49:22,904 INFO L240 hiAutomatonCegarLoop]: Abstraction has 830 states and 1363 transitions. [2025-03-09 06:49:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:22,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:49:22,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:49:22,905 INFO L87 Difference]: Start difference. First operand 830 states and 1363 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:22,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:22,952 INFO L93 Difference]: Finished difference Result 850 states and 1378 transitions. [2025-03-09 06:49:22,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 850 states and 1378 transitions. [2025-03-09 06:49:22,959 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 70 [2025-03-09 06:49:22,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 850 states to 850 states and 1378 transitions. [2025-03-09 06:49:22,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2025-03-09 06:49:22,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 218 [2025-03-09 06:49:22,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 850 states and 1378 transitions. [2025-03-09 06:49:22,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:22,967 INFO L218 hiAutomatonCegarLoop]: Abstraction has 850 states and 1378 transitions. [2025-03-09 06:49:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states and 1378 transitions. [2025-03-09 06:49:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 840. [2025-03-09 06:49:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 530 states have (on average 1.2037735849056603) internal successors, (638), 545 states have internal predecessors, (638), 200 states have call successors, (200), 106 states have call predecessors, (200), 110 states have return successors, (530), 188 states have call predecessors, (530), 196 states have call successors, (530) [2025-03-09 06:49:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1368 transitions. [2025-03-09 06:49:22,990 INFO L240 hiAutomatonCegarLoop]: Abstraction has 840 states and 1368 transitions. [2025-03-09 06:49:22,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:49:22,991 INFO L432 stractBuchiCegarLoop]: Abstraction has 840 states and 1368 transitions. [2025-03-09 06:49:22,991 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 06:49:22,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 840 states and 1368 transitions. [2025-03-09 06:49:22,995 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 70 [2025-03-09 06:49:22,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:22,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:22,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:22,997 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-09 06:49:22,997 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#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-09 06:49:22,998 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:22,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:22,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1480750595, now seen corresponding path program 2 times [2025-03-09 06:49:22,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:22,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012595855] [2025-03-09 06:49:22,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:22,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:23,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-09 06:49:23,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:49:23,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:23,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:23,050 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-09 06:49:23,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:23,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012595855] [2025-03-09 06:49:23,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012595855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:23,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857265692] [2025-03-09 06:49:23,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:23,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:23,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:23,054 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:23,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-03-09 06:49:23,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-09 06:49:23,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:49:23,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:23,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:23,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:49:23,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:23,127 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-09 06:49:23,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:23,190 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-09 06:49:23,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857265692] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:23,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:23,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-09 06:49:23,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723755791] [2025-03-09 06:49:23,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:23,190 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:23,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:23,190 INFO L85 PathProgramCache]: Analyzing trace with hash -860683794, now seen corresponding path program 2 times [2025-03-09 06:49:23,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:23,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936659688] [2025-03-09 06:49:23,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:23,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:23,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-09 06:49:23,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 06:49:23,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:23,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:23,243 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-09 06:49:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 36 proven. 58 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-09 06:49:23,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936659688] [2025-03-09 06:49:23,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936659688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966933129] [2025-03-09 06:49:23,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:23,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:23,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:23,351 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:23,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-03-09 06:49:23,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-09 06:49:23,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 06:49:23,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:23,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:23,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 06:49:23,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:23,448 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-09 06:49:23,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:23,856 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-09 06:49:23,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966933129] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:23,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:23,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 14] total 23 [2025-03-09 06:49:23,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461774458] [2025-03-09 06:49:23,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:23,857 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:23,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:23,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:49:23,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-09 06:49:23,858 INFO L87 Difference]: Start difference. First operand 840 states and 1368 transitions. cyclomatic complexity: 557 Second operand has 11 states, 8 states have (on average 3.0) internal successors, (24), 11 states have internal predecessors, (24), 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-09 06:49:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:24,007 INFO L93 Difference]: Finished difference Result 908 states and 1517 transitions. [2025-03-09 06:49:24,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 908 states and 1517 transitions. [2025-03-09 06:49:24,014 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 100 [2025-03-09 06:49:24,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 908 states to 908 states and 1517 transitions. [2025-03-09 06:49:24,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 250 [2025-03-09 06:49:24,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 250 [2025-03-09 06:49:24,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 908 states and 1517 transitions. [2025-03-09 06:49:24,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:24,023 INFO L218 hiAutomatonCegarLoop]: Abstraction has 908 states and 1517 transitions. [2025-03-09 06:49:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states and 1517 transitions. [2025-03-09 06:49:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 900. [2025-03-09 06:49:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 560 states have (on average 1.2035714285714285) internal successors, (674), 575 states have internal predecessors, (674), 230 states have call successors, (230), 106 states have call predecessors, (230), 110 states have return successors, (602), 218 states have call predecessors, (602), 226 states have call successors, (602) [2025-03-09 06:49:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1506 transitions. [2025-03-09 06:49:24,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 900 states and 1506 transitions. [2025-03-09 06:49:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:49:24,065 INFO L432 stractBuchiCegarLoop]: Abstraction has 900 states and 1506 transitions. [2025-03-09 06:49:24,065 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 06:49:24,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 900 states and 1506 transitions. [2025-03-09 06:49:24,069 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 100 [2025-03-09 06:49:24,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:24,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:24,071 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:24,073 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-09 06:49:24,073 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;" >"#48#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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-09 06:49:24,073 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:24,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:24,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1005543025, now seen corresponding path program 3 times [2025-03-09 06:49:24,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:24,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635226566] [2025-03-09 06:49:24,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:24,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:24,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 5 equivalence classes. [2025-03-09 06:49:24,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:49:24,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 06:49:24,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:24,114 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-09 06:49:24,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:24,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635226566] [2025-03-09 06:49:24,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635226566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:24,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100573590] [2025-03-09 06:49:24,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:24,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:24,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,117 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:24,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-03-09 06:49:24,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 5 equivalence classes. [2025-03-09 06:49:24,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:49:24,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 06:49:24,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:24,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:49:24,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:24,170 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-09 06:49:24,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:24,217 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-09 06:49:24,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100573590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:24,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:24,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-03-09 06:49:24,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989343611] [2025-03-09 06:49:24,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:24,218 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:24,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:24,218 INFO L85 PathProgramCache]: Analyzing trace with hash -860683794, now seen corresponding path program 3 times [2025-03-09 06:49:24,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:24,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086533604] [2025-03-09 06:49:24,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:24,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:24,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 8 equivalence classes. [2025-03-09 06:49:24,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 47 of 50 statements. [2025-03-09 06:49:24,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-09 06:49:24,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 34 proven. 59 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-09 06:49:24,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:24,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086533604] [2025-03-09 06:49:24,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086533604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:24,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017965722] [2025-03-09 06:49:24,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:24,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:24,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,378 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:24,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-03-09 06:49:24,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 8 equivalence classes. [2025-03-09 06:49:24,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 47 of 50 statements. [2025-03-09 06:49:24,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-09 06:49:24,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:24,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 06:49:24,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:24,480 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-09 06:49:24,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:24,862 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-09 06:49:24,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017965722] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:24,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:24,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 14] total 22 [2025-03-09 06:49:24,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100329911] [2025-03-09 06:49:24,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:24,862 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:24,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:24,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:49:24,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:49:24,863 INFO L87 Difference]: Start difference. First operand 900 states and 1506 transitions. cyclomatic complexity: 637 Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (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-09 06:49:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:24,936 INFO L93 Difference]: Finished difference Result 956 states and 1613 transitions. [2025-03-09 06:49:24,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 956 states and 1613 transitions. [2025-03-09 06:49:24,943 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 108 [2025-03-09 06:49:24,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 956 states to 956 states and 1613 transitions. [2025-03-09 06:49:24,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 268 [2025-03-09 06:49:24,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 268 [2025-03-09 06:49:24,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 956 states and 1613 transitions. [2025-03-09 06:49:24,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:24,952 INFO L218 hiAutomatonCegarLoop]: Abstraction has 956 states and 1613 transitions. [2025-03-09 06:49:24,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states and 1613 transitions. [2025-03-09 06:49:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 914. [2025-03-09 06:49:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 560 states have (on average 1.2035714285714285) internal successors, (674), 579 states have internal predecessors, (674), 244 states have call successors, (244), 106 states have call predecessors, (244), 110 states have return successors, (622), 228 states have call predecessors, (622), 240 states have call successors, (622) [2025-03-09 06:49:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1540 transitions. [2025-03-09 06:49:24,976 INFO L240 hiAutomatonCegarLoop]: Abstraction has 914 states and 1540 transitions. [2025-03-09 06:49:24,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:49:24,977 INFO L432 stractBuchiCegarLoop]: Abstraction has 914 states and 1540 transitions. [2025-03-09 06:49:24,977 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-09 06:49:24,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 914 states and 1540 transitions. [2025-03-09 06:49:24,982 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 103 [2025-03-09 06:49:24,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:24,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:24,983 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, 1] [2025-03-09 06:49:24,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:49:24,983 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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-09 06:49:24,984 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< [2025-03-09 06:49:24,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:24,984 INFO L85 PathProgramCache]: Analyzing trace with hash -919401685, now seen corresponding path program 1 times [2025-03-09 06:49:24,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381555902] [2025-03-09 06:49:24,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:24,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 06:49:24,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:49:24,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:24,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:24,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392338708] [2025-03-09 06:49:24,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:24,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:24,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,994 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:24,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-03-09 06:49:25,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 06:49:25,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:49:25,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:25,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:25,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:25,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 06:49:25,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:49:25,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:25,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:25,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:25,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:25,068 INFO L85 PathProgramCache]: Analyzing trace with hash 33769, now seen corresponding path program 2 times [2025-03-09 06:49:25,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:25,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080830584] [2025-03-09 06:49:25,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:25,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:25,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:25,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:25,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:49:25,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:25,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:25,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:25,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:25,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:25,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:25,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:25,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash -889147265, now seen corresponding path program 2 times [2025-03-09 06:49:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:25,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017355616] [2025-03-09 06:49:25,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:25,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:25,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-09 06:49:25,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 06:49:25,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:25,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:25,159 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-09 06:49:25,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:25,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017355616] [2025-03-09 06:49:25,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017355616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:25,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553839959] [2025-03-09 06:49:25,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:25,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:25,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:25,161 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:25,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-03-09 06:49:25,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-09 06:49:25,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 06:49:25,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:25,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:25,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:49:25,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:25,267 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-09 06:49:25,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:25,344 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-09 06:49:25,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553839959] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:25,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:25,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2025-03-09 06:49:25,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261087213] [2025-03-09 06:49:25,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:25,363 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:25,363 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:25,363 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:25,363 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:25,363 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:25,363 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:25,363 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:25,363 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:25,363 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2025-03-09 06:49:25,363 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:25,363 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:25,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:25,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:25,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:25,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:25,384 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:25,384 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:25,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:25,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:25,386 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:25,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-09 06:49:25,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:25,389 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:25,400 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:25,400 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-09 06:49:25,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:25,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:25,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:25,408 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:25,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-09 06:49:25,411 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:25,411 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:25,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:25,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:25,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:25,432 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:25,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-09 06:49:25,434 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:25,434 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:25,455 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:25,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:25,458 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:25,458 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:25,458 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:25,458 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:25,458 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:25,458 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:25,458 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:25,459 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:25,459 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2025-03-09 06:49:25,459 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:25,459 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:25,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:25,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:25,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:25,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:25,484 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:25,484 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:25,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:25,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:25,486 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:25,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-09 06:49:25,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-09 06:49:25,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:25,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:25,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:25,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:25,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:25,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:25,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:25,500 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:25,501 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-09 06:49:25,501 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:25,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:25,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:25,503 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:25,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-09 06:49:25,504 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:25,504 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:25,504 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:25,504 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2025-03-09 06:49:25,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-09 06:49:25,510 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:25,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:25,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 06:49:25,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:49:25,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:25,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:25,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:49:25,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:25,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:25,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:25,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:25,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:25,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:49:25,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:25,766 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-09 06:49:25,767 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-09 06:49:25,767 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 914 states and 1540 transitions. cyclomatic complexity: 657 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (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-09 06:49:25,847 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 914 states and 1540 transitions. cyclomatic complexity: 657. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (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 1007 states and 1662 transitions. Complement of second has 17 states. [2025-03-09 06:49:25,847 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-09 06:49:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (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-09 06:49:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2025-03-09 06:49:25,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 47 letters. Loop has 3 letters. [2025-03-09 06:49:25,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:25,849 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:25,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:25,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 06:49:25,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:49:25,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:25,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:25,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:49:25,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:26,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:26,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:26,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:26,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:26,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:49:26,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:26,085 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-09 06:49:26,085 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-09 06:49:26,085 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 914 states and 1540 transitions. cyclomatic complexity: 657 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (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-09 06:49:26,155 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 914 states and 1540 transitions. cyclomatic complexity: 657. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (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 1007 states and 1662 transitions. Complement of second has 17 states. [2025-03-09 06:49:26,155 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-09 06:49:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (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-09 06:49:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2025-03-09 06:49:26,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 47 letters. Loop has 3 letters. [2025-03-09 06:49:26,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:26,156 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:26,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:26,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 06:49:26,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:49:26,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:26,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:26,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:49:26,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:26,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:26,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:26,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:26,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:26,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:49:26,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:26,386 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-09 06:49:26,386 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-09 06:49:26,387 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 914 states and 1540 transitions. cyclomatic complexity: 657 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (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-09 06:49:26,470 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 914 states and 1540 transitions. cyclomatic complexity: 657. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (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 1178 states and 1876 transitions. Complement of second has 19 states. [2025-03-09 06:49:26,472 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-09 06:49:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (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-09 06:49:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2025-03-09 06:49:26,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 47 letters. Loop has 3 letters. [2025-03-09 06:49:26,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:26,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 50 letters. Loop has 3 letters. [2025-03-09 06:49:26,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:26,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 47 letters. Loop has 6 letters. [2025-03-09 06:49:26,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:26,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1178 states and 1876 transitions. [2025-03-09 06:49:26,480 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 97 [2025-03-09 06:49:26,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1178 states to 959 states and 1616 transitions. [2025-03-09 06:49:26,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2025-03-09 06:49:26,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2025-03-09 06:49:26,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 959 states and 1616 transitions. [2025-03-09 06:49:26,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:26,488 INFO L218 hiAutomatonCegarLoop]: Abstraction has 959 states and 1616 transitions. [2025-03-09 06:49:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states and 1616 transitions. [2025-03-09 06:49:26,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-09 06:49:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 866. [2025-03-09 06:49:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 534 states have (on average 1.2078651685393258) internal successors, (645), 547 states have internal predecessors, (645), 226 states have call successors, (226), 98 states have call predecessors, (226), 106 states have return successors, (586), 220 states have call predecessors, (586), 226 states have call successors, (586) [2025-03-09 06:49:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1457 transitions. [2025-03-09 06:49:26,529 INFO L240 hiAutomatonCegarLoop]: Abstraction has 866 states and 1457 transitions. [2025-03-09 06:49:26,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:26,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 06:49:26,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:49:26,529 INFO L87 Difference]: Start difference. First operand 866 states and 1457 transitions. Second operand has 13 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-09 06:49:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:26,707 INFO L93 Difference]: Finished difference Result 1456 states and 2455 transitions. [2025-03-09 06:49:26,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1456 states and 2455 transitions. [2025-03-09 06:49:26,716 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 150 [2025-03-09 06:49:26,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1456 states to 1420 states and 2415 transitions. [2025-03-09 06:49:26,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 358 [2025-03-09 06:49:26,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 358 [2025-03-09 06:49:26,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1420 states and 2415 transitions. [2025-03-09 06:49:26,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:26,729 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1420 states and 2415 transitions. [2025-03-09 06:49:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states and 2415 transitions. [2025-03-09 06:49:26,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1242. [2025-03-09 06:49:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 750 states have (on average 1.2066666666666668) internal successors, (905), 789 states have internal predecessors, (905), 340 states have call successors, (340), 142 states have call predecessors, (340), 152 states have return successors, (832), 310 states have call predecessors, (832), 340 states have call successors, (832) [2025-03-09 06:49:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2077 transitions. [2025-03-09 06:49:26,760 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1242 states and 2077 transitions. [2025-03-09 06:49:26,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 06:49:26,761 INFO L432 stractBuchiCegarLoop]: Abstraction has 1242 states and 2077 transitions. [2025-03-09 06:49:26,761 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-09 06:49:26,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1242 states and 2077 transitions. [2025-03-09 06:49:26,766 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 126 [2025-03-09 06:49:26,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:26,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:26,767 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:26,767 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-09 06:49:26,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;" "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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#50#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-09 06:49:26,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);" "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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:26,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:26,768 INFO L85 PathProgramCache]: Analyzing trace with hash 872773462, now seen corresponding path program 1 times [2025-03-09 06:49:26,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:26,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517394715] [2025-03-09 06:49:26,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:26,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:26,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:49:26,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:49:26,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:26,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-09 06:49:26,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:26,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517394715] [2025-03-09 06:49:26,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517394715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:26,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:26,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 06:49:26,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048560776] [2025-03-09 06:49:26,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:26,836 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:26,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:26,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1942084370, now seen corresponding path program 4 times [2025-03-09 06:49:26,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:26,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164353423] [2025-03-09 06:49:26,836 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:26,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:26,840 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 74 statements into 2 equivalence classes. [2025-03-09 06:49:26,843 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 06:49:26,843 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:49:26,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 22 proven. 202 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-09 06:49:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164353423] [2025-03-09 06:49:26,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164353423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466648975] [2025-03-09 06:49:26,989 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:26,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:26,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:26,992 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-09 06:49:26,993 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-09 06:49:27,030 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 74 statements into 2 equivalence classes. [2025-03-09 06:49:27,041 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 06:49:27,041 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:49:27,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:27,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:49:27,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:27,087 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-09 06:49:27,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:27,597 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-09 06:49:27,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466648975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:27,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:27,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 18] total 23 [2025-03-09 06:49:27,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224068480] [2025-03-09 06:49:27,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:27,598 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:27,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:27,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:49:27,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:49:27,598 INFO L87 Difference]: Start difference. First operand 1242 states and 2077 transitions. cyclomatic complexity: 860 Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-09 06:49:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:27,720 INFO L93 Difference]: Finished difference Result 861 states and 1336 transitions. [2025-03-09 06:49:27,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 861 states and 1336 transitions. [2025-03-09 06:49:27,724 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 78 [2025-03-09 06:49:27,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 861 states to 781 states and 1178 transitions. [2025-03-09 06:49:27,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2025-03-09 06:49:27,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2025-03-09 06:49:27,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 781 states and 1178 transitions. [2025-03-09 06:49:27,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:27,730 INFO L218 hiAutomatonCegarLoop]: Abstraction has 781 states and 1178 transitions. [2025-03-09 06:49:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states and 1178 transitions. [2025-03-09 06:49:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 735. [2025-03-09 06:49:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 455 states have (on average 1.1538461538461537) internal successors, (525), 476 states have internal predecessors, (525), 170 states have call successors, (170), 74 states have call predecessors, (170), 110 states have return successors, (404), 184 states have call predecessors, (404), 170 states have call successors, (404) [2025-03-09 06:49:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1099 transitions. [2025-03-09 06:49:27,745 INFO L240 hiAutomatonCegarLoop]: Abstraction has 735 states and 1099 transitions. [2025-03-09 06:49:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:49:27,745 INFO L432 stractBuchiCegarLoop]: Abstraction has 735 states and 1099 transitions. [2025-03-09 06:49:27,745 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-09 06:49:27,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 735 states and 1099 transitions. [2025-03-09 06:49:27,747 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 68 [2025-03-09 06:49:27,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:27,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:27,749 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:27,749 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 6, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:27,749 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:27,749 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;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:27,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1146062653, now seen corresponding path program 1 times [2025-03-09 06:49:27,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:27,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652038606] [2025-03-09 06:49:27,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:27,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:27,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 06:49:27,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:27,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:27,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:27,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1946688048] [2025-03-09 06:49:27,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:27,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:27,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:27,765 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:27,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-03-09 06:49:27,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 06:49:27,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:27,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:27,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:27,823 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:27,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 06:49:27,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:27,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:27,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:27,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:27,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:27,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2006665060, now seen corresponding path program 1 times [2025-03-09 06:49:27,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:27,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823312776] [2025-03-09 06:49:27,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:27,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:27,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 06:49:27,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 06:49:27,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:27,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 29 proven. 60 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-09 06:49:27,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:27,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823312776] [2025-03-09 06:49:27,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823312776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:27,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863203658] [2025-03-09 06:49:27,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:27,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:27,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:27,962 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:27,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-03-09 06:49:28,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 06:49:28,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 06:49:28,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:28,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:28,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:49:28,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 156 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-09 06:49:28,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 22 proven. 113 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-09 06:49:28,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863203658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:28,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:28,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 21 [2025-03-09 06:49:28,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785454660] [2025-03-09 06:49:28,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:28,364 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:28,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:28,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 06:49:28,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2025-03-09 06:49:28,365 INFO L87 Difference]: Start difference. First operand 735 states and 1099 transitions. cyclomatic complexity: 382 Second operand has 21 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 14 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (23), 12 states have call predecessors, (23), 14 states have call successors, (23) [2025-03-09 06:49:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:28,775 INFO L93 Difference]: Finished difference Result 1061 states and 1573 transitions. [2025-03-09 06:49:28,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1061 states and 1573 transitions. [2025-03-09 06:49:28,781 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 120 [2025-03-09 06:49:28,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1061 states to 1025 states and 1535 transitions. [2025-03-09 06:49:28,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 274 [2025-03-09 06:49:28,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 274 [2025-03-09 06:49:28,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1025 states and 1535 transitions. [2025-03-09 06:49:28,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:28,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1025 states and 1535 transitions. [2025-03-09 06:49:28,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states and 1535 transitions. [2025-03-09 06:49:28,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 847. [2025-03-09 06:49:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 527 states have (on average 1.1214421252371916) internal successors, (591), 526 states have internal predecessors, (591), 210 states have call successors, (210), 114 states have call predecessors, (210), 110 states have return successors, (458), 206 states have call predecessors, (458), 210 states have call successors, (458) [2025-03-09 06:49:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1259 transitions. [2025-03-09 06:49:28,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 847 states and 1259 transitions. [2025-03-09 06:49:28,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 06:49:28,809 INFO L432 stractBuchiCegarLoop]: Abstraction has 847 states and 1259 transitions. [2025-03-09 06:49:28,809 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-09 06:49:28,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 847 states and 1259 transitions. [2025-03-09 06:49:28,812 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 77 [2025-03-09 06:49:28,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:28,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:28,812 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:28,813 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 8, 8, 8, 8, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:28,813 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:28,813 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;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:28,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:28,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1146062653, now seen corresponding path program 2 times [2025-03-09 06:49:28,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:28,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409400247] [2025-03-09 06:49:28,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:28,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:28,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-09 06:49:28,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:28,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:28,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:28,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1172460744] [2025-03-09 06:49:28,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:28,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:28,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:28,829 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:28,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-03-09 06:49:28,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-09 06:49:28,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:28,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:28,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:28,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:28,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 06:49:28,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:28,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:28,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:28,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:28,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:28,946 INFO L85 PathProgramCache]: Analyzing trace with hash -690336118, now seen corresponding path program 2 times [2025-03-09 06:49:28,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:28,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237558265] [2025-03-09 06:49:28,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:28,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:28,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-03-09 06:49:28,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 06:49:28,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:28,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-09 06:49:29,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:29,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237558265] [2025-03-09 06:49:29,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237558265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:29,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599790493] [2025-03-09 06:49:29,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:29,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:29,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:29,057 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:29,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-03-09 06:49:29,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-03-09 06:49:29,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-03-09 06:49:29,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:29,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:29,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:49:29,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 227 proven. 80 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-09 06:49:29,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:29,543 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 23 proven. 156 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-09 06:49:29,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599790493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:29,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:29,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 14] total 23 [2025-03-09 06:49:29,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055785012] [2025-03-09 06:49:29,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:29,544 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:29,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:29,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 06:49:29,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-03-09 06:49:29,545 INFO L87 Difference]: Start difference. First operand 847 states and 1259 transitions. cyclomatic complexity: 430 Second operand has 23 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 21 states have internal predecessors, (55), 14 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (25), 11 states have call predecessors, (25), 14 states have call successors, (25) [2025-03-09 06:49:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:30,147 INFO L93 Difference]: Finished difference Result 1141 states and 1837 transitions. [2025-03-09 06:49:30,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1141 states and 1837 transitions. [2025-03-09 06:49:30,154 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 175 [2025-03-09 06:49:30,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1141 states to 1141 states and 1837 transitions. [2025-03-09 06:49:30,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331 [2025-03-09 06:49:30,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331 [2025-03-09 06:49:30,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1141 states and 1837 transitions. [2025-03-09 06:49:30,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:30,163 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1141 states and 1837 transitions. [2025-03-09 06:49:30,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states and 1837 transitions. [2025-03-09 06:49:30,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 941. [2025-03-09 06:49:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 571 states have (on average 1.1050788091068302) internal successors, (631), 566 states have internal predecessors, (631), 262 states have call successors, (262), 112 states have call predecessors, (262), 108 states have return successors, (612), 262 states have call predecessors, (612), 262 states have call successors, (612) [2025-03-09 06:49:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1505 transitions. [2025-03-09 06:49:30,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 941 states and 1505 transitions. [2025-03-09 06:49:30,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 06:49:30,202 INFO L432 stractBuchiCegarLoop]: Abstraction has 941 states and 1505 transitions. [2025-03-09 06:49:30,202 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-09 06:49:30,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 941 states and 1505 transitions. [2025-03-09 06:49:30,204 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 128 [2025-03-09 06:49:30,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:30,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:30,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:30,205 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-09 06:49:30,205 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:30,205 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:30,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:30,206 INFO L85 PathProgramCache]: Analyzing trace with hash -101577552, now seen corresponding path program 2 times [2025-03-09 06:49:30,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:30,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012280160] [2025-03-09 06:49:30,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:30,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:30,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-03-09 06:49:30,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 06:49:30,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:30,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:30,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185515913] [2025-03-09 06:49:30,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:30,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:30,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:30,218 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:30,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-03-09 06:49:30,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-03-09 06:49:30,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 06:49:30,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:30,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:30,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:30,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 06:49:30,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 06:49:30,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:30,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:30,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:30,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:30,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1780851400, now seen corresponding path program 5 times [2025-03-09 06:49:30,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:30,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36873858] [2025-03-09 06:49:30,309 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:30,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:30,313 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 11 equivalence classes. [2025-03-09 06:49:30,319 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 06:49:30,320 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-09 06:49:30,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:30,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009943270] [2025-03-09 06:49:30,321 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:30,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:30,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:30,324 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:30,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2025-03-09 06:49:30,372 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 11 equivalence classes. [2025-03-09 06:49:30,398 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 06:49:30,399 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-09 06:49:30,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:30,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:30,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 06:49:30,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 06:49:30,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:30,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:30,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:30,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:30,440 INFO L85 PathProgramCache]: Analyzing trace with hash -2034903433, now seen corresponding path program 3 times [2025-03-09 06:49:30,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:30,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006929861] [2025-03-09 06:49:30,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:30,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:30,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 114 statements into 12 equivalence classes. [2025-03-09 06:49:30,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 100 of 114 statements. [2025-03-09 06:49:30,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 06:49:30,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 108 proven. 79 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2025-03-09 06:49:30,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:30,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006929861] [2025-03-09 06:49:30,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006929861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:30,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779101911] [2025-03-09 06:49:30,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:30,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:30,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:30,566 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:30,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-03-09 06:49:30,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 114 statements into 12 equivalence classes. [2025-03-09 06:49:30,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 100 of 114 statements. [2025-03-09 06:49:30,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 06:49:30,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:30,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 06:49:30,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 169 proven. 15 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-09 06:49:30,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 169 proven. 19 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2025-03-09 06:49:31,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779101911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:31,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:31,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 23 [2025-03-09 06:49:31,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677535060] [2025-03-09 06:49:31,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:31,430 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:31,430 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:31,430 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:31,430 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:31,430 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:31,430 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,430 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:31,430 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:31,430 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2025-03-09 06:49:31,430 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:31,430 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:31,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,477 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:31,477 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:31,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,480 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-09 06:49:31,481 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-09 06:49:31,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:31,482 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:31,492 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:31,492 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-09 06:49:31,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-09 06:49:31,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,499 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-09 06:49:31,499 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-09 06:49:31,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:31,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:31,510 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:31,510 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-09 06:49:31,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-09 06:49:31,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,517 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-09 06:49:31,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:31,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:31,529 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:31,529 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-09 06:49:31,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-09 06:49:31,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,535 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-09 06:49:31,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:31,537 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:31,547 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:31,547 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-09 06:49:31,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-09 06:49:31,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,554 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-09 06:49:31,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:31,556 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:31,572 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:31,572 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-09 06:49:31,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-09 06:49:31,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,579 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-09 06:49:31,580 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:31,580 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:31,590 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:31,590 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-09 06:49:31,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-09 06:49:31,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,597 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-09 06:49:31,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:31,598 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:31,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-03-09 06:49:31,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,616 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-09 06:49:31,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:31,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:31,629 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:31,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-09 06:49:31,635 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:31,635 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:31,635 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:31,635 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:31,635 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:31,635 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,635 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:31,635 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:31,635 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2025-03-09 06:49:31,635 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:31,635 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:31,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:31,684 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:31,684 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:31,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,686 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-09 06:49:31,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:31,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:31,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:31,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:31,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:31,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:31,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:31,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:31,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:31,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-09 06:49:31,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,705 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-09 06:49:31,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:31,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:31,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:31,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:31,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:31,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:31,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:31,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:31,718 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:31,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-09 06:49:31,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,725 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-09 06:49:31,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:31,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:31,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:31,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:31,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:31,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:31,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:31,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:31,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:31,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-09 06:49:31,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,744 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-09 06:49:31,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-09 06:49:31,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:31,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:31,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:31,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:31,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:31,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:31,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:31,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:31,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-09 06:49:31,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,766 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-09 06:49:31,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:31,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:31,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:31,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:31,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:31,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:31,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:31,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:31,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:31,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:31,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,787 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-09 06:49:31,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:31,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:31,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:31,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:31,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:31,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:31,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:31,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:31,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:31,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-09 06:49:31,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,806 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-03-09 06:49:31,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:31,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:31,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:31,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:31,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:31,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:31,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:31,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:31,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:31,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:31,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,827 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-03-09 06:49:31,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:31,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:31,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:31,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:31,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:31,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:31,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:31,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:31,841 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:31,842 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:31,842 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:31,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:31,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:31,844 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:31,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-03-09 06:49:31,846 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:31,846 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:31,846 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:31,846 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-09 06:49:31,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-03-09 06:49:31,852 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:31,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:31,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 06:49:31,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 06:49:31,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:31,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:31,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:49:31,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:32,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 06:49:32,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 06:49:32,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:32,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:32,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 06:49:32,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-09 06:49:32,322 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-09 06:49:32,322 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 941 states and 1505 transitions. cyclomatic complexity: 582 Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-09 06:49:32,540 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 941 states and 1505 transitions. cyclomatic complexity: 582. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Result 1967 states and 2982 transitions. Complement of second has 65 states. [2025-03-09 06:49:32,541 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-09 06:49:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-09 06:49:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 70 transitions. [2025-03-09 06:49:32,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 70 transitions. Stem has 58 letters. Loop has 56 letters. [2025-03-09 06:49:32,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:32,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 70 transitions. Stem has 114 letters. Loop has 56 letters. [2025-03-09 06:49:32,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:32,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 70 transitions. Stem has 58 letters. Loop has 112 letters. [2025-03-09 06:49:32,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:32,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1967 states and 2982 transitions. [2025-03-09 06:49:32,575 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 128 [2025-03-09 06:49:32,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-03-09 06:49:32,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1967 states to 1333 states and 2104 transitions. [2025-03-09 06:49:32,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 277 [2025-03-09 06:49:32,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 278 [2025-03-09 06:49:32,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1333 states and 2104 transitions. [2025-03-09 06:49:32,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:32,589 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1333 states and 2104 transitions. [2025-03-09 06:49:32,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states and 2104 transitions. [2025-03-09 06:49:32,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1202. [2025-03-09 06:49:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 738 states have (on average 1.1070460704607046) internal successors, (817), 731 states have internal predecessors, (817), 308 states have call successors, (308), 144 states have call predecessors, (308), 156 states have return successors, (784), 326 states have call predecessors, (784), 308 states have call successors, (784) [2025-03-09 06:49:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1909 transitions. [2025-03-09 06:49:32,616 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1202 states and 1909 transitions. [2025-03-09 06:49:32,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:32,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 06:49:32,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-03-09 06:49:32,618 INFO L87 Difference]: Start difference. First operand 1202 states and 1909 transitions. Second operand has 23 states, 20 states have (on average 3.5) internal successors, (70), 23 states have internal predecessors, (70), 16 states have call successors, (33), 1 states have call predecessors, (33), 4 states have return successors, (34), 13 states have call predecessors, (34), 16 states have call successors, (34) [2025-03-09 06:49:33,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:33,092 INFO L93 Difference]: Finished difference Result 1736 states and 3028 transitions. [2025-03-09 06:49:33,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1736 states and 3028 transitions. [2025-03-09 06:49:33,101 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 228 [2025-03-09 06:49:33,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1736 states to 1724 states and 3008 transitions. [2025-03-09 06:49:33,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 486 [2025-03-09 06:49:33,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 486 [2025-03-09 06:49:33,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1724 states and 3008 transitions. [2025-03-09 06:49:33,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:33,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1724 states and 3008 transitions. [2025-03-09 06:49:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states and 3008 transitions. [2025-03-09 06:49:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1376. [2025-03-09 06:49:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 832 states have (on average 1.1081730769230769) internal successors, (922), 827 states have internal predecessors, (922), 382 states have call successors, (382), 144 states have call predecessors, (382), 162 states have return successors, (976), 404 states have call predecessors, (976), 382 states have call successors, (976) [2025-03-09 06:49:33,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2280 transitions. [2025-03-09 06:49:33,155 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1376 states and 2280 transitions. [2025-03-09 06:49:33,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 06:49:33,156 INFO L432 stractBuchiCegarLoop]: Abstraction has 1376 states and 2280 transitions. [2025-03-09 06:49:33,156 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-09 06:49:33,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1376 states and 2280 transitions. [2025-03-09 06:49:33,159 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 156 [2025-03-09 06:49:33,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:33,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:33,160 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:33,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 10, 10, 10, 10, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:33,161 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:33,161 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:33,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:33,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1146062653, now seen corresponding path program 3 times [2025-03-09 06:49:33,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:33,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718061650] [2025-03-09 06:49:33,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:33,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:33,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 8 equivalence classes. [2025-03-09 06:49:33,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:33,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-09 06:49:33,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:33,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1497425295] [2025-03-09 06:49:33,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:33,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:33,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:33,177 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:33,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2025-03-09 06:49:33,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 8 equivalence classes. [2025-03-09 06:49:33,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:33,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-09 06:49:33,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:33,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:33,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 06:49:33,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:33,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:33,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:33,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:33,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:33,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1455141233, now seen corresponding path program 3 times [2025-03-09 06:49:33,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:33,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933736938] [2025-03-09 06:49:33,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:33,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:33,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 10 equivalence classes. [2025-03-09 06:49:33,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 110 of 122 statements. [2025-03-09 06:49:33,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-09 06:49:33,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 156 proven. 104 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2025-03-09 06:49:33,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:33,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933736938] [2025-03-09 06:49:33,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933736938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:33,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487901364] [2025-03-09 06:49:33,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:33,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:33,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:33,450 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:33,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2025-03-09 06:49:33,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 10 equivalence classes. [2025-03-09 06:49:33,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 110 of 122 statements. [2025-03-09 06:49:33,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-09 06:49:33,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:33,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:49:33,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 167 proven. 140 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-09 06:49:33,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 167 proven. 143 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-03-09 06:49:33,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487901364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:33,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:33,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 27 [2025-03-09 06:49:33,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034503961] [2025-03-09 06:49:33,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:33,953 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:33,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:33,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 06:49:33,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2025-03-09 06:49:33,954 INFO L87 Difference]: Start difference. First operand 1376 states and 2280 transitions. cyclomatic complexity: 926 Second operand has 27 states, 19 states have (on average 3.0) internal successors, (57), 24 states have internal predecessors, (57), 19 states have call successors, (28), 1 states have call predecessors, (28), 5 states have return successors, (28), 14 states have call predecessors, (28), 19 states have call successors, (28) [2025-03-09 06:49:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:34,665 INFO L93 Difference]: Finished difference Result 1921 states and 3214 transitions. [2025-03-09 06:49:34,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1921 states and 3214 transitions. [2025-03-09 06:49:34,675 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 321 [2025-03-09 06:49:34,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1921 states to 1747 states and 2849 transitions. [2025-03-09 06:49:34,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 555 [2025-03-09 06:49:34,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 556 [2025-03-09 06:49:34,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1747 states and 2849 transitions. [2025-03-09 06:49:34,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:34,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1747 states and 2849 transitions. [2025-03-09 06:49:34,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states and 2849 transitions. [2025-03-09 06:49:34,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1437. [2025-03-09 06:49:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 892 states have (on average 1.108744394618834) internal successors, (989), 887 states have internal predecessors, (989), 383 states have call successors, (383), 148 states have call predecessors, (383), 162 states have return successors, (919), 401 states have call predecessors, (919), 383 states have call successors, (919) [2025-03-09 06:49:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2291 transitions. [2025-03-09 06:49:34,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1437 states and 2291 transitions. [2025-03-09 06:49:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 06:49:34,746 INFO L432 stractBuchiCegarLoop]: Abstraction has 1437 states and 2291 transitions. [2025-03-09 06:49:34,746 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-09 06:49:34,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1437 states and 2291 transitions. [2025-03-09 06:49:34,750 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 204 [2025-03-09 06:49:34,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:34,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:34,751 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:34,751 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 9, 9, 9, 9, 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-09 06:49:34,751 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:34,752 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:34,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:34,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1146062653, now seen corresponding path program 4 times [2025-03-09 06:49:34,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:34,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274663881] [2025-03-09 06:49:34,753 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:34,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:34,756 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-09 06:49:34,768 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:34,768 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:34,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:34,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1974101696] [2025-03-09 06:49:34,769 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:34,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:34,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:34,776 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:34,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2025-03-09 06:49:34,825 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-09 06:49:34,841 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:34,841 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:34,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:34,841 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:34,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 06:49:34,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:34,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:34,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:34,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:34,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:34,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1756265803, now seen corresponding path program 4 times [2025-03-09 06:49:34,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:34,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596217324] [2025-03-09 06:49:34,868 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:34,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:34,873 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-03-09 06:49:34,878 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 06:49:34,879 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:49:34,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 74 proven. 114 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-09 06:49:35,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596217324] [2025-03-09 06:49:35,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596217324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515147529] [2025-03-09 06:49:35,015 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:35,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:35,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:35,018 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:35,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2025-03-09 06:49:35,070 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-03-09 06:49:35,088 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 06:49:35,088 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:49:35,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:35,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:49:35,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 397 proven. 115 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-09 06:49:35,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 53 proven. 278 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-09 06:49:35,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515147529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:35,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:35,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 17] total 27 [2025-03-09 06:49:35,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494128006] [2025-03-09 06:49:35,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:35,589 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:35,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:35,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 06:49:35,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2025-03-09 06:49:35,590 INFO L87 Difference]: Start difference. First operand 1437 states and 2291 transitions. cyclomatic complexity: 881 Second operand has 27 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 25 states have internal predecessors, (63), 16 states have call successors, (32), 2 states have call predecessors, (32), 7 states have return successors, (33), 15 states have call predecessors, (33), 16 states have call successors, (33) [2025-03-09 06:49:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:36,493 INFO L93 Difference]: Finished difference Result 2047 states and 3292 transitions. [2025-03-09 06:49:36,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2047 states and 3292 transitions. [2025-03-09 06:49:36,503 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 433 [2025-03-09 06:49:36,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2047 states to 2035 states and 3277 transitions. [2025-03-09 06:49:36,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 700 [2025-03-09 06:49:36,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 700 [2025-03-09 06:49:36,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2035 states and 3277 transitions. [2025-03-09 06:49:36,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:36,518 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2035 states and 3277 transitions. [2025-03-09 06:49:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states and 3277 transitions. [2025-03-09 06:49:36,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1641. [2025-03-09 06:49:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1015 states have (on average 1.095566502463054) internal successors, (1112), 1009 states have internal predecessors, (1112), 464 states have call successors, (464), 148 states have call predecessors, (464), 162 states have return successors, (1092), 483 states have call predecessors, (1092), 464 states have call successors, (1092) [2025-03-09 06:49:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2668 transitions. [2025-03-09 06:49:36,559 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1641 states and 2668 transitions. [2025-03-09 06:49:36,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-09 06:49:36,560 INFO L432 stractBuchiCegarLoop]: Abstraction has 1641 states and 2668 transitions. [2025-03-09 06:49:36,560 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-09 06:49:36,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1641 states and 2668 transitions. [2025-03-09 06:49:36,565 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 320 [2025-03-09 06:49:36,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:36,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:36,567 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:36,567 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 16, 9, 7, 7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:36,567 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:36,567 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:36,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:36,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1146062653, now seen corresponding path program 5 times [2025-03-09 06:49:36,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:36,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547498855] [2025-03-09 06:49:36,568 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:36,573 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 8 equivalence classes. [2025-03-09 06:49:36,584 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:36,584 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-09 06:49:36,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:36,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [426884993] [2025-03-09 06:49:36,585 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:36,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:36,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:36,588 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:36,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2025-03-09 06:49:36,641 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 8 equivalence classes. [2025-03-09 06:49:36,661 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:36,661 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-09 06:49:36,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:36,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:36,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 06:49:36,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:36,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:36,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:36,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:36,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:36,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2132292543, now seen corresponding path program 5 times [2025-03-09 06:49:36,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:36,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091811583] [2025-03-09 06:49:36,685 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:36,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:36,691 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 104 statements into 9 equivalence classes. [2025-03-09 06:49:36,714 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 92 of 104 statements. [2025-03-09 06:49:36,714 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-09 06:49:36,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 76 proven. 86 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-09 06:49:36,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:36,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091811583] [2025-03-09 06:49:36,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091811583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:36,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314270562] [2025-03-09 06:49:36,869 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:36,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:36,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:36,871 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:36,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2025-03-09 06:49:36,935 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 104 statements into 9 equivalence classes. [2025-03-09 06:49:36,953 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 92 of 104 statements. [2025-03-09 06:49:36,954 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-09 06:49:36,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:36,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:49:36,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 316 proven. 76 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 06:49:37,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 56 proven. 185 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 06:49:37,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314270562] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:37,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:37,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 24 [2025-03-09 06:49:37,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215990346] [2025-03-09 06:49:37,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:37,309 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:37,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:37,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 06:49:37,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2025-03-09 06:49:37,310 INFO L87 Difference]: Start difference. First operand 1641 states and 2668 transitions. cyclomatic complexity: 1062 Second operand has 24 states, 16 states have (on average 3.375) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (29), 2 states have call predecessors, (29), 6 states have return successors, (29), 13 states have call predecessors, (29), 16 states have call successors, (29) [2025-03-09 06:49:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:37,750 INFO L93 Difference]: Finished difference Result 2044 states and 3351 transitions. [2025-03-09 06:49:37,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2044 states and 3351 transitions. [2025-03-09 06:49:37,760 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 430 [2025-03-09 06:49:37,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2044 states to 2040 states and 3347 transitions. [2025-03-09 06:49:37,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 694 [2025-03-09 06:49:37,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 694 [2025-03-09 06:49:37,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2040 states and 3347 transitions. [2025-03-09 06:49:37,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:37,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2040 states and 3347 transitions. [2025-03-09 06:49:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states and 3347 transitions. [2025-03-09 06:49:37,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1746. [2025-03-09 06:49:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1075 states have (on average 1.0976744186046512) internal successors, (1180), 1071 states have internal predecessors, (1180), 509 states have call successors, (509), 154 states have call predecessors, (509), 162 states have return successors, (1183), 520 states have call predecessors, (1183), 509 states have call successors, (1183) [2025-03-09 06:49:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 2872 transitions. [2025-03-09 06:49:37,822 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1746 states and 2872 transitions. [2025-03-09 06:49:37,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 06:49:37,823 INFO L432 stractBuchiCegarLoop]: Abstraction has 1746 states and 2872 transitions. [2025-03-09 06:49:37,823 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-09 06:49:37,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1746 states and 2872 transitions. [2025-03-09 06:49:37,827 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 364 [2025-03-09 06:49:37,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:37,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:37,828 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:37,828 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-09 06:49:37,828 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:37,828 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:37,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:37,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1146062653, now seen corresponding path program 6 times [2025-03-09 06:49:37,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:37,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361727663] [2025-03-09 06:49:37,829 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:37,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:37,833 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 8 equivalence classes. [2025-03-09 06:49:37,838 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:37,839 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-09 06:49:37,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:37,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [125318658] [2025-03-09 06:49:37,839 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:37,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:37,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:37,842 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:37,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2025-03-09 06:49:37,899 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 8 equivalence classes. [2025-03-09 06:49:37,920 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:37,920 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-09 06:49:37,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:37,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:37,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 06:49:37,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:37,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:37,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:37,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:37,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:37,957 INFO L85 PathProgramCache]: Analyzing trace with hash 538600783, now seen corresponding path program 6 times [2025-03-09 06:49:37,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:37,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285596633] [2025-03-09 06:49:37,957 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:37,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:37,961 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 110 statements into 9 equivalence classes. [2025-03-09 06:49:37,978 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 06:49:37,978 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-09 06:49:37,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:37,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552201905] [2025-03-09 06:49:37,980 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:37,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:37,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:37,985 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:37,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2025-03-09 06:49:38,061 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 110 statements into 9 equivalence classes. [2025-03-09 06:49:38,092 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 06:49:38,092 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-09 06:49:38,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:38,092 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:38,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 06:49:38,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 06:49:38,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:38,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:38,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:38,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:38,141 INFO L85 PathProgramCache]: Analyzing trace with hash -588856437, now seen corresponding path program 7 times [2025-03-09 06:49:38,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:38,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386020967] [2025-03-09 06:49:38,141 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:49:38,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:38,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-09 06:49:38,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-09 06:49:38,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:38,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 18 proven. 35 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2025-03-09 06:49:38,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:38,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386020967] [2025-03-09 06:49:38,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386020967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:38,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779690435] [2025-03-09 06:49:38,231 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:49:38,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:38,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:38,233 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:38,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2025-03-09 06:49:38,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-09 06:49:38,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-09 06:49:38,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:38,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:38,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:49:38,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 584 proven. 32 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2025-03-09 06:49:38,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 32 proven. 32 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2025-03-09 06:49:38,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779690435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:38,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:38,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2025-03-09 06:49:38,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847709689] [2025-03-09 06:49:38,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:39,194 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:39,194 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:39,194 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:39,194 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:39,194 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:39,194 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:39,194 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:39,194 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:39,194 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration20_Loop [2025-03-09 06:49:39,194 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:39,194 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:39,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,253 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:39,253 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:39,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:39,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:39,255 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-09 06:49:39,256 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-09 06:49:39,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:39,257 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:39,267 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:39,267 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-09 06:49:39,272 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-09 06:49:39,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:39,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:39,275 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-09 06:49:39,275 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-09 06:49:39,276 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:39,276 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:39,286 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:39,286 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-09 06:49:39,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:39,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:39,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:39,295 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-09 06:49:39,296 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-09 06:49:39,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:39,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:39,307 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:39,308 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-09 06:49:39,313 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-09 06:49:39,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:39,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:39,315 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-09 06:49:39,317 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-09 06:49:39,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:39,318 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:39,333 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-09 06:49:39,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:39,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:39,335 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-09 06:49:39,336 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-09 06:49:39,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:39,337 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:39,348 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:39,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:39,354 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:39,354 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:39,354 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:39,354 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:39,354 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:39,354 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:39,354 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:39,354 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:39,354 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration20_Loop [2025-03-09 06:49:39,354 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:39,354 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:39,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,411 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:39,411 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:39,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:39,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:39,413 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-09 06:49:39,414 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-09 06:49:39,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:39,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:39,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:39,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:39,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:39,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:39,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:39,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:39,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:39,431 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-09 06:49:39,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:39,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:39,433 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-09 06:49:39,433 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-09 06:49:39,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:39,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:39,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:39,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:39,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:39,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:39,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:39,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:39,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:39,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:39,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:39,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:39,452 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-09 06:49:39,453 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-09 06:49:39,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:39,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:39,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:39,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:39,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:39,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:39,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:39,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:39,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:39,470 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-09 06:49:39,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:39,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:39,472 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-09 06:49:39,472 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-09 06:49:39,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:39,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:39,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:39,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:39,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:39,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:39,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:39,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:39,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:39,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2025-03-09 06:49:39,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:39,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:39,492 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-09 06:49:39,493 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-09 06:49:39,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:39,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:39,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:39,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:39,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:39,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:39,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:39,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:39,506 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:39,507 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:39,507 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:39,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:39,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:39,509 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-09 06:49:39,510 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-09 06:49:39,510 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:39,510 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:39,510 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:39,510 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 3 Supporting invariants [] [2025-03-09 06:49:39,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-03-09 06:49:39,516 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:39,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:39,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 06:49:39,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:49:39,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:39,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:39,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:49:39,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:39,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 06:49:39,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 06:49:39,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:39,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:39,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-09 06:49:39,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 5 proven. 107 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2025-03-09 06:49:40,040 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-09 06:49:40,041 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1746 states and 2872 transitions. cyclomatic complexity: 1161 Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-09 06:49:40,221 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1746 states and 2872 transitions. cyclomatic complexity: 1161. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Result 3857 states and 6343 transitions. Complement of second has 40 states. [2025-03-09 06:49:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2025-03-09 06:49:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-09 06:49:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2025-03-09 06:49:40,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 80 transitions. Stem has 59 letters. Loop has 110 letters. [2025-03-09 06:49:40,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:40,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 80 transitions. Stem has 169 letters. Loop has 110 letters. [2025-03-09 06:49:40,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:40,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 80 transitions. Stem has 59 letters. Loop has 220 letters. [2025-03-09 06:49:40,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:40,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3857 states and 6343 transitions. [2025-03-09 06:49:40,245 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 416 [2025-03-09 06:49:40,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3857 states to 2195 states and 3647 transitions. [2025-03-09 06:49:40,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 721 [2025-03-09 06:49:40,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 724 [2025-03-09 06:49:40,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2195 states and 3647 transitions. [2025-03-09 06:49:40,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:40,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2195 states and 3647 transitions. [2025-03-09 06:49:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states and 3647 transitions. [2025-03-09 06:49:40,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-03-09 06:49:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 2154. [2025-03-09 06:49:40,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 1318 states have (on average 1.0933232169954477) internal successors, (1441), 1313 states have internal predecessors, (1441), 656 states have call successors, (656), 180 states have call predecessors, (656), 180 states have return successors, (1497), 660 states have call predecessors, (1497), 656 states have call successors, (1497) [2025-03-09 06:49:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 3594 transitions. [2025-03-09 06:49:40,356 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2154 states and 3594 transitions. [2025-03-09 06:49:40,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:40,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 06:49:40,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-09 06:49:40,356 INFO L87 Difference]: Start difference. First operand 2154 states and 3594 transitions. Second operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 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-09 06:49:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:40,787 INFO L93 Difference]: Finished difference Result 5376 states and 9369 transitions. [2025-03-09 06:49:40,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5376 states and 9369 transitions. [2025-03-09 06:49:40,821 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 906 [2025-03-09 06:49:40,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5376 states to 4087 states and 7175 transitions. [2025-03-09 06:49:40,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2167 [2025-03-09 06:49:40,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2169 [2025-03-09 06:49:40,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4087 states and 7175 transitions. [2025-03-09 06:49:40,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:40,856 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4087 states and 7175 transitions. [2025-03-09 06:49:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087 states and 7175 transitions. [2025-03-09 06:49:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087 to 2391. [2025-03-09 06:49:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 1452 states have (on average 1.0826446280991735) internal successors, (1572), 1448 states have internal predecessors, (1572), 759 states have call successors, (759), 180 states have call predecessors, (759), 180 states have return successors, (1739), 762 states have call predecessors, (1739), 759 states have call successors, (1739) [2025-03-09 06:49:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 4070 transitions. [2025-03-09 06:49:40,927 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2391 states and 4070 transitions. [2025-03-09 06:49:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 06:49:40,928 INFO L432 stractBuchiCegarLoop]: Abstraction has 2391 states and 4070 transitions. [2025-03-09 06:49:40,928 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-09 06:49:40,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2391 states and 4070 transitions. [2025-03-09 06:49:40,935 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 641 [2025-03-09 06:49:40,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:40,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:40,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 14, 9, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:40,935 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-09 06:49:40,936 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:40,936 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:40,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:40,936 INFO L85 PathProgramCache]: Analyzing trace with hash 585836957, now seen corresponding path program 4 times [2025-03-09 06:49:40,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:40,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322538137] [2025-03-09 06:49:40,936 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:40,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:40,940 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 96 statements into 2 equivalence classes. [2025-03-09 06:49:40,944 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 06:49:40,944 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:49:40,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 94 proven. 5 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-03-09 06:49:41,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:41,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322538137] [2025-03-09 06:49:41,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322538137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:41,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980684212] [2025-03-09 06:49:41,045 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:41,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:41,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:41,047 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:41,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2025-03-09 06:49:41,107 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 96 statements into 2 equivalence classes. [2025-03-09 06:49:41,126 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 06:49:41,126 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:49:41,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:41,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:49:41,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 94 proven. 5 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-03-09 06:49:41,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 94 proven. 6 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-03-09 06:49:41,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980684212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:41,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:41,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 16 [2025-03-09 06:49:41,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307125656] [2025-03-09 06:49:41,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:41,386 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:41,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash -168200146, now seen corresponding path program 6 times [2025-03-09 06:49:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:41,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617882051] [2025-03-09 06:49:41,386 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:41,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:41,389 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 12 equivalence classes. [2025-03-09 06:49:41,398 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:49:41,398 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-03-09 06:49:41,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 44 proven. 121 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-09 06:49:41,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:41,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617882051] [2025-03-09 06:49:41,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617882051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:41,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938129148] [2025-03-09 06:49:41,605 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:41,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:41,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:41,608 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:41,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2025-03-09 06:49:41,664 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 12 equivalence classes. [2025-03-09 06:49:41,695 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:49:41,695 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-03-09 06:49:41,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:41,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:49:41,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 41 proven. 112 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-09 06:49:41,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 41 proven. 133 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 06:49:42,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938129148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:42,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:42,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 20] total 31 [2025-03-09 06:49:42,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782633960] [2025-03-09 06:49:42,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:42,460 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:42,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:42,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 06:49:42,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2025-03-09 06:49:42,461 INFO L87 Difference]: Start difference. First operand 2391 states and 4070 transitions. cyclomatic complexity: 1735 Second operand has 31 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 18 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (24), 15 states have call predecessors, (24), 18 states have call successors, (24) [2025-03-09 06:49:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:43,077 INFO L93 Difference]: Finished difference Result 3127 states and 5784 transitions. [2025-03-09 06:49:43,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3127 states and 5784 transitions. [2025-03-09 06:49:43,095 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 856 [2025-03-09 06:49:43,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3127 states to 3116 states and 5773 transitions. [2025-03-09 06:49:43,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1258 [2025-03-09 06:49:43,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1258 [2025-03-09 06:49:43,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3116 states and 5773 transitions. [2025-03-09 06:49:43,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:43,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3116 states and 5773 transitions. [2025-03-09 06:49:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states and 5773 transitions. [2025-03-09 06:49:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 2549. [2025-03-09 06:49:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 1501 states have (on average 1.0799467021985343) internal successors, (1621), 1496 states have internal predecessors, (1621), 861 states have call successors, (861), 198 states have call predecessors, (861), 187 states have return successors, (2284), 854 states have call predecessors, (2284), 861 states have call successors, (2284) [2025-03-09 06:49:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 4766 transitions. [2025-03-09 06:49:43,187 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2549 states and 4766 transitions. [2025-03-09 06:49:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-09 06:49:43,188 INFO L432 stractBuchiCegarLoop]: Abstraction has 2549 states and 4766 transitions. [2025-03-09 06:49:43,188 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-09 06:49:43,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2549 states and 4766 transitions. [2025-03-09 06:49:43,197 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 685 [2025-03-09 06:49:43,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:43,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:43,199 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 14, 9, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:43,200 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-09 06:49:43,200 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:43,200 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:43,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash 585836957, now seen corresponding path program 5 times [2025-03-09 06:49:43,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:43,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438311102] [2025-03-09 06:49:43,201 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:43,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:43,207 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 96 statements into 10 equivalence classes. [2025-03-09 06:49:43,217 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 90 of 96 statements. [2025-03-09 06:49:43,217 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-09 06:49:43,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 120 proven. 44 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-03-09 06:49:43,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:43,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438311102] [2025-03-09 06:49:43,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438311102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:43,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580330184] [2025-03-09 06:49:43,360 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:43,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:43,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:43,363 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:43,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2025-03-09 06:49:43,432 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 96 statements into 10 equivalence classes. [2025-03-09 06:49:43,457 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 90 of 96 statements. [2025-03-09 06:49:43,457 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-09 06:49:43,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:43,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:49:43,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 119 proven. 43 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-09 06:49:43,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:43,705 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 119 proven. 45 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-03-09 06:49:43,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580330184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:43,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:43,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 18 [2025-03-09 06:49:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488528774] [2025-03-09 06:49:43,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:43,706 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:43,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:43,706 INFO L85 PathProgramCache]: Analyzing trace with hash -168977644, now seen corresponding path program 7 times [2025-03-09 06:49:43,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:43,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134812475] [2025-03-09 06:49:43,706 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:49:43,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:43,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 06:49:43,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 06:49:43,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:43,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 26 proven. 339 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-09 06:49:43,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:43,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134812475] [2025-03-09 06:49:43,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134812475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:43,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674232441] [2025-03-09 06:49:43,856 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:49:43,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:43,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:43,859 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:43,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2025-03-09 06:49:43,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 06:49:43,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 06:49:43,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:43,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:43,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 06:49:43,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 290 proven. 140 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-09 06:49:43,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 26 proven. 364 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-09 06:49:44,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674232441] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:44,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:44,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 22] total 25 [2025-03-09 06:49:44,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70676318] [2025-03-09 06:49:44,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:44,744 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:44,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:44,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 06:49:44,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2025-03-09 06:49:44,744 INFO L87 Difference]: Start difference. First operand 2549 states and 4766 transitions. cyclomatic complexity: 2273 Second operand has 25 states, 22 states have (on average 2.590909090909091) internal successors, (57), 24 states have internal predecessors, (57), 15 states have call successors, (17), 2 states have call predecessors, (17), 11 states have return successors, (22), 11 states have call predecessors, (22), 15 states have call successors, (22) [2025-03-09 06:49:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:45,272 INFO L93 Difference]: Finished difference Result 3263 states and 6528 transitions. [2025-03-09 06:49:45,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3263 states and 6528 transitions. [2025-03-09 06:49:45,294 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 792 [2025-03-09 06:49:45,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3263 states to 3243 states and 6497 transitions. [2025-03-09 06:49:45,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1244 [2025-03-09 06:49:45,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1256 [2025-03-09 06:49:45,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3243 states and 6497 transitions. [2025-03-09 06:49:45,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:45,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3243 states and 6497 transitions. [2025-03-09 06:49:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states and 6497 transitions. [2025-03-09 06:49:45,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 2805. [2025-03-09 06:49:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2805 states, 1651 states have (on average 1.0938824954572985) internal successors, (1806), 1636 states have internal predecessors, (1806), 936 states have call successors, (936), 249 states have call predecessors, (936), 218 states have return successors, (2943), 919 states have call predecessors, (2943), 936 states have call successors, (2943) [2025-03-09 06:49:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 5685 transitions. [2025-03-09 06:49:45,391 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2805 states and 5685 transitions. [2025-03-09 06:49:45,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 06:49:45,392 INFO L432 stractBuchiCegarLoop]: Abstraction has 2805 states and 5685 transitions. [2025-03-09 06:49:45,392 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-09 06:49:45,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2805 states and 5685 transitions. [2025-03-09 06:49:45,402 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 693 [2025-03-09 06:49:45,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:45,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:45,403 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [17, 17, 10, 7, 7, 7, 7, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:45,403 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-09 06:49:45,403 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" [2025-03-09 06:49:45,404 INFO L754 eck$LassoCheckResult]: Loop: "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" [2025-03-09 06:49:45,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:45,404 INFO L85 PathProgramCache]: Analyzing trace with hash -158746257, now seen corresponding path program 8 times [2025-03-09 06:49:45,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:45,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784515002] [2025-03-09 06:49:45,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:45,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:45,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-03-09 06:49:45,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 06:49:45,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:45,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 102 proven. 27 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2025-03-09 06:49:45,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:45,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784515002] [2025-03-09 06:49:45,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784515002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:45,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186837614] [2025-03-09 06:49:45,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:45,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:45,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:45,510 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:45,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2025-03-09 06:49:45,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-03-09 06:49:45,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 06:49:45,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:45,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:45,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:49:45,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 290 proven. 5 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-03-09 06:49:45,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 102 proven. 28 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-03-09 06:49:45,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186837614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:45,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:45,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 17 [2025-03-09 06:49:45,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973393871] [2025-03-09 06:49:45,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:45,883 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:45,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:45,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1003744170, now seen corresponding path program 5 times [2025-03-09 06:49:45,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:45,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288424485] [2025-03-09 06:49:45,883 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:45,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:45,886 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 6 equivalence classes. [2025-03-09 06:49:45,892 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:49:45,892 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 06:49:45,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:45,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [605879623] [2025-03-09 06:49:45,892 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:45,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:45,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:45,894 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:45,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2025-03-09 06:49:45,967 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 6 equivalence classes. [2025-03-09 06:49:45,976 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:49:45,976 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 06:49:45,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:45,976 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:45,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 06:49:45,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:49:45,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:45,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:45,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:46,152 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:46,152 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:46,152 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:46,152 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:46,152 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:46,152 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:46,152 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:46,152 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:46,152 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration23_Loop [2025-03-09 06:49:46,152 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:46,152 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:46,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,211 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:46,211 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:46,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:46,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:46,213 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:46,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-03-09 06:49:46,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:46,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:46,225 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:46,226 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=2} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:46,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-03-09 06:49:46,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:46,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:46,233 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:46,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-03-09 06:49:46,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:46,234 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:46,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-03-09 06:49:46,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:46,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:46,252 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:46,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-03-09 06:49:46,254 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:46,254 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:46,318 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:46,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-03-09 06:49:46,323 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:46,323 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:46,323 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:46,323 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:46,323 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:46,323 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:46,323 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:46,323 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:46,323 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration23_Loop [2025-03-09 06:49:46,323 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:46,323 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:46,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:46,384 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:46,384 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:46,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:46,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:46,386 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-09 06:49:46,387 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-09 06:49:46,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:46,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:46,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:46,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:46,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:46,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:46,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:46,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:46,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:46,406 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-09 06:49:46,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:46,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:46,408 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-09 06:49:46,410 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-09 06:49:46,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:46,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:46,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:46,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:46,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:46,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:46,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:46,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:46,424 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:46,426 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:46,426 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:46,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:46,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:46,428 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-09 06:49:46,428 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-09 06:49:46,429 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:46,429 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:46,429 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:46,429 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_binomialCoefficient_~n#1) = -2*ULTIMATE.start_binomialCoefficient_~n#1 + 3 Supporting invariants [] [2025-03-09 06:49:46,434 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-09 06:49:46,435 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:46,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:46,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-09 06:49:46,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 06:49:46,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:46,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:46,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-09 06:49:46,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:46,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 06:49:46,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:49:46,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:46,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:46,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 06:49:46,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 38 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 06:49:47,038 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-09 06:49:47,039 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2805 states and 5685 transitions. cyclomatic complexity: 2936 Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 06:49:47,444 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-09 06:49:47,622 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2805 states and 5685 transitions. cyclomatic complexity: 2936. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Result 10224 states and 17083 transitions. Complement of second has 140 states. [2025-03-09 06:49:47,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 2 stem states 21 non-accepting loop states 1 accepting loop states [2025-03-09 06:49:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 06:49:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 113 transitions. [2025-03-09 06:49:47,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 113 transitions. Stem has 116 letters. Loop has 38 letters. [2025-03-09 06:49:47,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:47,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 113 transitions. Stem has 154 letters. Loop has 38 letters. [2025-03-09 06:49:47,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:47,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 113 transitions. Stem has 116 letters. Loop has 76 letters. [2025-03-09 06:49:47,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:47,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10224 states and 17083 transitions. [2025-03-09 06:49:47,699 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 884 [2025-03-09 06:49:47,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10224 states to 7822 states and 13413 transitions. [2025-03-09 06:49:47,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1976 [2025-03-09 06:49:47,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2066 [2025-03-09 06:49:47,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7822 states and 13413 transitions. [2025-03-09 06:49:47,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:47,773 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7822 states and 13413 transitions. [2025-03-09 06:49:47,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7822 states and 13413 transitions. [2025-03-09 06:49:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7822 to 6861. [2025-03-09 06:49:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6861 states, 4126 states have (on average 1.092825981580223) internal successors, (4509), 4119 states have internal predecessors, (4509), 1990 states have call successors, (2040), 692 states have call predecessors, (2040), 745 states have return successors, (5449), 2049 states have call predecessors, (5449), 1990 states have call successors, (5449) [2025-03-09 06:49:47,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6861 states to 6861 states and 11998 transitions. [2025-03-09 06:49:47,949 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6861 states and 11998 transitions. [2025-03-09 06:49:47,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:47,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 06:49:47,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-09 06:49:47,950 INFO L87 Difference]: Start difference. First operand 6861 states and 11998 transitions. Second operand has 17 states, 14 states have (on average 4.142857142857143) internal successors, (58), 17 states have internal predecessors, (58), 11 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 10 states have call predecessors, (27), 11 states have call successors, (27) [2025-03-09 06:49:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:48,293 INFO L93 Difference]: Finished difference Result 3666 states and 6661 transitions. [2025-03-09 06:49:48,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3666 states and 6661 transitions. [2025-03-09 06:49:48,318 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 715 [2025-03-09 06:49:48,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3666 states to 2933 states and 5778 transitions. [2025-03-09 06:49:48,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1173 [2025-03-09 06:49:48,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1239 [2025-03-09 06:49:48,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2933 states and 5778 transitions. [2025-03-09 06:49:48,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:48,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2933 states and 5778 transitions. [2025-03-09 06:49:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states and 5778 transitions. [2025-03-09 06:49:48,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2821. [2025-03-09 06:49:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 1664 states have (on average 1.0973557692307692) internal successors, (1826), 1647 states have internal predecessors, (1826), 940 states have call successors, (940), 252 states have call predecessors, (940), 217 states have return successors, (2878), 921 states have call predecessors, (2878), 940 states have call successors, (2878) [2025-03-09 06:49:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 5644 transitions. [2025-03-09 06:49:48,400 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2821 states and 5644 transitions. [2025-03-09 06:49:48,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 06:49:48,401 INFO L432 stractBuchiCegarLoop]: Abstraction has 2821 states and 5644 transitions. [2025-03-09 06:49:48,401 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-09 06:49:48,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2821 states and 5644 transitions. [2025-03-09 06:49:48,412 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 715 [2025-03-09 06:49:48,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:48,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:48,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 14, 9, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:48,413 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-09 06:49:48,413 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:48,413 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:48,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1872071529, now seen corresponding path program 6 times [2025-03-09 06:49:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:48,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679488656] [2025-03-09 06:49:48,414 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:48,418 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 10 equivalence classes. [2025-03-09 06:49:48,425 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 78 of 96 statements. [2025-03-09 06:49:48,425 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-09 06:49:48,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-03-09 06:49:48,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:48,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679488656] [2025-03-09 06:49:48,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679488656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:48,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863688018] [2025-03-09 06:49:48,463 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:48,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:48,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:48,466 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:48,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2025-03-09 06:49:48,542 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 10 equivalence classes. [2025-03-09 06:49:48,564 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 78 of 96 statements. [2025-03-09 06:49:48,565 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-09 06:49:48,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:48,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:49:48,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-03-09 06:49:48,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:49:48,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863688018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:48,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:49:48,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 7 [2025-03-09 06:49:48,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043237548] [2025-03-09 06:49:48,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:48,584 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:48,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1849897620, now seen corresponding path program 8 times [2025-03-09 06:49:48,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:48,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114773973] [2025-03-09 06:49:48,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:48,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:48,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-09 06:49:48,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 06:49:48,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:48,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:48,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [592837905] [2025-03-09 06:49:48,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:48,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:48,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:48,593 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-09 06:49:48,595 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-09 06:49:48,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-09 06:49:48,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 06:49:48,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:48,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:48,695 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:48,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 06:49:48,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 06:49:48,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:48,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:48,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:49,158 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:49,158 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:49,158 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:49,158 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:49,158 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:49,158 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:49,158 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:49,158 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:49,158 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2025-03-09 06:49:49,158 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:49,158 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:49,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,200 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:49,200 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:49,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:49,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:49,203 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:49,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-03-09 06:49:49,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:49,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:49,215 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:49,215 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-09 06:49:49,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2025-03-09 06:49:49,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:49,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:49,227 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:49,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-03-09 06:49:49,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:49,229 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:49,239 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:49,239 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-09 06:49:49,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-03-09 06:49:49,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:49,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:49,247 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:49,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-03-09 06:49:49,249 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:49,249 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:49,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2025-03-09 06:49:49,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:49,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:49,269 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:49,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-03-09 06:49:49,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:49,270 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:49,281 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:49,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2025-03-09 06:49:49,288 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:49,288 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:49,288 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:49,288 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:49,288 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:49,288 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:49,288 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:49,288 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:49,288 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2025-03-09 06:49:49,288 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:49,288 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:49,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:49,342 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:49,343 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:49,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:49,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:49,345 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:49,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-03-09 06:49:49,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:49,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:49,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:49,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:49,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:49,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:49,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:49,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:49,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:49,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-03-09 06:49:49,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:49,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:49,366 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-09 06:49:49,367 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-09 06:49:49,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:49:49,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:49,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:49,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:49,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:49,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:49,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:49,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:49,380 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:49,381 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:49,381 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:49,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:49,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:49,383 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-09 06:49:49,384 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-09 06:49:49,385 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:49,385 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:49,385 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:49,385 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-09 06:49:49,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:49,391 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:49,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:49,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 06:49:49,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 06:49:49,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:49,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:49,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 06:49:49,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:49,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 06:49:49,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 06:49:49,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:49,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:49,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 06:49:49,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:49,872 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-09 06:49:49,960 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-09 06:49:49,960 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-09 06:49:49,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2821 states and 5644 transitions. cyclomatic complexity: 2881 Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2025-03-09 06:49:50,203 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2821 states and 5644 transitions. cyclomatic complexity: 2881. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) Result 4368 states and 7686 transitions. Complement of second has 77 states. [2025-03-09 06:49:50,203 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-09 06:49:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2025-03-09 06:49:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 75 transitions. [2025-03-09 06:49:50,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 75 transitions. Stem has 96 letters. Loop has 68 letters. [2025-03-09 06:49:50,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:50,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 75 transitions. Stem has 164 letters. Loop has 68 letters. [2025-03-09 06:49:50,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:50,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 75 transitions. Stem has 96 letters. Loop has 136 letters. [2025-03-09 06:49:50,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:50,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4368 states and 7686 transitions. [2025-03-09 06:49:50,229 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 714 [2025-03-09 06:49:50,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4368 states to 3346 states and 6330 transitions. [2025-03-09 06:49:50,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1162 [2025-03-09 06:49:50,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1163 [2025-03-09 06:49:50,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3346 states and 6330 transitions. [2025-03-09 06:49:50,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:50,258 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3346 states and 6330 transitions. [2025-03-09 06:49:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states and 6330 transitions. [2025-03-09 06:49:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 3051. [2025-03-09 06:49:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3051 states, 1810 states have (on average 1.0977900552486188) internal successors, (1987), 1797 states have internal predecessors, (1987), 984 states have call successors, (984), 282 states have call predecessors, (984), 257 states have return successors, (2988), 971 states have call predecessors, (2988), 984 states have call successors, (2988) [2025-03-09 06:49:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3051 states to 3051 states and 5959 transitions. [2025-03-09 06:49:50,352 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3051 states and 5959 transitions. [2025-03-09 06:49:50,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:50,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:49:50,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:49:50,352 INFO L87 Difference]: Start difference. First operand 3051 states and 5959 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 06:49:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:50,459 INFO L93 Difference]: Finished difference Result 3056 states and 5849 transitions. [2025-03-09 06:49:50,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3056 states and 5849 transitions. [2025-03-09 06:49:50,485 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 703 [2025-03-09 06:49:50,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3056 states to 3048 states and 5841 transitions. [2025-03-09 06:49:50,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1171 [2025-03-09 06:49:50,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1171 [2025-03-09 06:49:50,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3048 states and 5841 transitions. [2025-03-09 06:49:50,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:50,518 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3048 states and 5841 transitions. [2025-03-09 06:49:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states and 5841 transitions. [2025-03-09 06:49:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 2953. [2025-03-09 06:49:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 1753 states have (on average 1.096406160867085) internal successors, (1922), 1740 states have internal predecessors, (1922), 951 states have call successors, (951), 276 states have call predecessors, (951), 249 states have return successors, (2833), 936 states have call predecessors, (2833), 951 states have call successors, (2833) [2025-03-09 06:49:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 5706 transitions. [2025-03-09 06:49:50,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2953 states and 5706 transitions. [2025-03-09 06:49:50,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:49:50,585 INFO L432 stractBuchiCegarLoop]: Abstraction has 2953 states and 5706 transitions. [2025-03-09 06:49:50,585 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-09 06:49:50,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2953 states and 5706 transitions. [2025-03-09 06:49:50,593 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 685 [2025-03-09 06:49:50,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:50,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:50,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:50,593 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-09 06:49:50,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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:50,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);" "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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:50,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:50,597 INFO L85 PathProgramCache]: Analyzing trace with hash 704506179, now seen corresponding path program 7 times [2025-03-09 06:49:50,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:50,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222600317] [2025-03-09 06:49:50,597 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:49:50,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:50,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:49:50,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:49:50,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:50,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:50,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030796914] [2025-03-09 06:49:50,607 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:49:50,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:50,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:50,609 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:50,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2025-03-09 06:49:50,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:49:50,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:49:50,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:50,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:50,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:50,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:49:50,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:49:50,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:50,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:50,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:50,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:50,756 INFO L85 PathProgramCache]: Analyzing trace with hash -656846060, now seen corresponding path program 9 times [2025-03-09 06:49:50,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:50,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225525091] [2025-03-09 06:49:50,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:50,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:50,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 13 equivalence classes. [2025-03-09 06:49:50,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 62 of 68 statements. [2025-03-09 06:49:50,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 06:49:50,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 78 proven. 124 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-09 06:49:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225525091] [2025-03-09 06:49:50,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225525091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996288796] [2025-03-09 06:49:50,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:50,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:50,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:50,985 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:50,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2025-03-09 06:49:51,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 13 equivalence classes. [2025-03-09 06:49:51,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 62 of 68 statements. [2025-03-09 06:49:51,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 06:49:51,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:51,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:49:51,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 76 proven. 115 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-09 06:49:51,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 76 proven. 134 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-09 06:49:51,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996288796] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:51,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:51,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 18] total 28 [2025-03-09 06:49:51,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447135360] [2025-03-09 06:49:51,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:51,802 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:51,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:51,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 06:49:51,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-03-09 06:49:51,805 INFO L87 Difference]: Start difference. First operand 2953 states and 5706 transitions. cyclomatic complexity: 2815 Second operand has 28 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 17 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (22), 14 states have call predecessors, (22), 17 states have call successors, (22) [2025-03-09 06:49:52,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:52,356 INFO L93 Difference]: Finished difference Result 3848 states and 7118 transitions. [2025-03-09 06:49:52,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3848 states and 7118 transitions. [2025-03-09 06:49:52,375 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 897 [2025-03-09 06:49:52,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3848 states to 3795 states and 7048 transitions. [2025-03-09 06:49:52,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1398 [2025-03-09 06:49:52,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1398 [2025-03-09 06:49:52,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3795 states and 7048 transitions. [2025-03-09 06:49:52,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:52,418 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3795 states and 7048 transitions. [2025-03-09 06:49:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states and 7048 transitions. [2025-03-09 06:49:52,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 3087. [2025-03-09 06:49:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3087 states, 1830 states have (on average 1.0923497267759563) internal successors, (1999), 1816 states have internal predecessors, (1999), 984 states have call successors, (984), 291 states have call predecessors, (984), 273 states have return successors, (2948), 979 states have call predecessors, (2948), 984 states have call successors, (2948) [2025-03-09 06:49:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 5931 transitions. [2025-03-09 06:49:52,488 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3087 states and 5931 transitions. [2025-03-09 06:49:52,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 06:49:52,489 INFO L432 stractBuchiCegarLoop]: Abstraction has 3087 states and 5931 transitions. [2025-03-09 06:49:52,489 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-03-09 06:49:52,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3087 states and 5931 transitions. [2025-03-09 06:49:52,512 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 682 [2025-03-09 06:49:52,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:52,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:52,514 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:52,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 11, 11, 11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:52,514 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:52,514 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:52,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:52,515 INFO L85 PathProgramCache]: Analyzing trace with hash 704506179, now seen corresponding path program 8 times [2025-03-09 06:49:52,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:52,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265675641] [2025-03-09 06:49:52,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:52,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:52,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-03-09 06:49:52,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:49:52,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:52,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:52,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1576551402] [2025-03-09 06:49:52,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:52,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:52,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:52,540 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:52,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2025-03-09 06:49:52,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-03-09 06:49:52,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:49:52,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:52,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:52,660 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:52,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:49:52,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:49:52,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:52,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:52,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:52,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:52,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1947035474, now seen corresponding path program 10 times [2025-03-09 06:49:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:52,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198778947] [2025-03-09 06:49:52,706 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:52,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:52,710 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 86 statements into 2 equivalence classes. [2025-03-09 06:49:52,712 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 06:49:52,712 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:49:52,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 76 proven. 261 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-09 06:49:52,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:52,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198778947] [2025-03-09 06:49:52,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198778947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:52,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954795894] [2025-03-09 06:49:52,907 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:52,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:52,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:52,910 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:52,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2025-03-09 06:49:52,994 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 86 statements into 2 equivalence classes. [2025-03-09 06:49:53,010 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 06:49:53,010 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:49:53,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:53,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 06:49:53,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 69 proven. 261 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-09 06:49:53,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 69 proven. 306 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-09 06:49:54,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954795894] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:54,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:54,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 26] total 31 [2025-03-09 06:49:54,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366359868] [2025-03-09 06:49:54,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:54,321 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:54,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:54,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 06:49:54,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2025-03-09 06:49:54,321 INFO L87 Difference]: Start difference. First operand 3087 states and 5931 transitions. cyclomatic complexity: 2906 Second operand has 31 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 17 states have call successors, (17), 1 states have call predecessors, (17), 12 states have return successors, (25), 15 states have call predecessors, (25), 17 states have call successors, (25) [2025-03-09 06:49:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:55,024 INFO L93 Difference]: Finished difference Result 4457 states and 8868 transitions. [2025-03-09 06:49:55,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4457 states and 8868 transitions. [2025-03-09 06:49:55,053 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 901 [2025-03-09 06:49:55,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4457 states to 4418 states and 8810 transitions. [2025-03-09 06:49:55,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1517 [2025-03-09 06:49:55,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1541 [2025-03-09 06:49:55,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4418 states and 8810 transitions. [2025-03-09 06:49:55,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:55,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4418 states and 8810 transitions. [2025-03-09 06:49:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states and 8810 transitions. [2025-03-09 06:49:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 3563. [2025-03-09 06:49:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 2059 states have (on average 1.092277804759592) internal successors, (2249), 2023 states have internal predecessors, (2249), 1190 states have call successors, (1190), 377 states have call predecessors, (1190), 314 states have return successors, (4110), 1162 states have call predecessors, (4110), 1190 states have call successors, (4110) [2025-03-09 06:49:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 7549 transitions. [2025-03-09 06:49:55,222 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3563 states and 7549 transitions. [2025-03-09 06:49:55,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-09 06:49:55,223 INFO L432 stractBuchiCegarLoop]: Abstraction has 3563 states and 7549 transitions. [2025-03-09 06:49:55,223 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-03-09 06:49:55,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3563 states and 7549 transitions. [2025-03-09 06:49:55,239 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 747 [2025-03-09 06:49:55,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:55,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:55,240 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:55,241 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 14, 14, 14, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:55,241 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:55,241 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:55,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:55,242 INFO L85 PathProgramCache]: Analyzing trace with hash 704506179, now seen corresponding path program 9 times [2025-03-09 06:49:55,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:55,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975768202] [2025-03-09 06:49:55,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:55,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:55,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 102 statements into 10 equivalence classes. [2025-03-09 06:49:55,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:49:55,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-09 06:49:55,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:55,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199087482] [2025-03-09 06:49:55,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:55,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:55,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:55,266 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:55,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2025-03-09 06:49:55,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 102 statements into 10 equivalence classes. [2025-03-09 06:49:55,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:49:55,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-09 06:49:55,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:55,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:55,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:49:55,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:49:55,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:55,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:55,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:55,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:55,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1603807828, now seen corresponding path program 11 times [2025-03-09 06:49:55,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:55,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025895947] [2025-03-09 06:49:55,494 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:55,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:55,498 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 104 statements into 22 equivalence classes. [2025-03-09 06:49:55,502 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 06:49:55,502 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2025-03-09 06:49:55,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 123 proven. 396 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-09 06:49:55,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:55,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025895947] [2025-03-09 06:49:55,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025895947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:55,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074156192] [2025-03-09 06:49:55,782 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:55,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:55,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:55,795 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:55,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2025-03-09 06:49:55,893 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 104 statements into 22 equivalence classes. [2025-03-09 06:49:55,913 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 06:49:55,913 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2025-03-09 06:49:55,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:55,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 06:49:55,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 109 proven. 392 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-09 06:49:55,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 109 proven. 468 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-09 06:49:57,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074156192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:57,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:57,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 30] total 38 [2025-03-09 06:49:57,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859472254] [2025-03-09 06:49:57,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:57,836 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:57,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:57,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-09 06:49:57,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2025-03-09 06:49:57,837 INFO L87 Difference]: Start difference. First operand 3563 states and 7549 transitions. cyclomatic complexity: 4048 Second operand has 38 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 21 states have call successors, (21), 1 states have call predecessors, (21), 15 states have return successors, (32), 20 states have call predecessors, (32), 21 states have call successors, (32) [2025-03-09 06:49:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:59,076 INFO L93 Difference]: Finished difference Result 6299 states and 14398 transitions. [2025-03-09 06:49:59,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6299 states and 14398 transitions. [2025-03-09 06:49:59,125 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 1346 [2025-03-09 06:49:59,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6299 states to 6272 states and 14353 transitions. [2025-03-09 06:49:59,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2244 [2025-03-09 06:49:59,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2274 [2025-03-09 06:49:59,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6272 states and 14353 transitions. [2025-03-09 06:49:59,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:59,195 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6272 states and 14353 transitions. [2025-03-09 06:49:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6272 states and 14353 transitions. [2025-03-09 06:49:59,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6272 to 4107. [2025-03-09 06:49:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4107 states, 2309 states have (on average 1.090515374621048) internal successors, (2518), 2254 states have internal predecessors, (2518), 1421 states have call successors, (1421), 446 states have call predecessors, (1421), 377 states have return successors, (6363), 1406 states have call predecessors, (6363), 1421 states have call successors, (6363) [2025-03-09 06:49:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4107 states to 4107 states and 10302 transitions. [2025-03-09 06:49:59,456 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4107 states and 10302 transitions. [2025-03-09 06:49:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-09 06:49:59,458 INFO L432 stractBuchiCegarLoop]: Abstraction has 4107 states and 10302 transitions. [2025-03-09 06:49:59,458 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-03-09 06:49:59,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4107 states and 10302 transitions. [2025-03-09 06:49:59,531 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 832 [2025-03-09 06:49:59,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:59,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:59,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:59,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 15, 15, 15, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:59,537 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:59,539 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);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:49:59,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:59,540 INFO L85 PathProgramCache]: Analyzing trace with hash 704506179, now seen corresponding path program 10 times [2025-03-09 06:49:59,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:59,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151955094] [2025-03-09 06:49:59,540 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:59,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:59,551 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 102 statements into 2 equivalence classes. [2025-03-09 06:49:59,565 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:49:59,565 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:59,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:49:59,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [982579922] [2025-03-09 06:49:59,566 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:59,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:59,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:59,575 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:59,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2025-03-09 06:49:59,709 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 102 statements into 2 equivalence classes. [2025-03-09 06:49:59,729 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:49:59,729 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:59,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:59,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:59,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:49:59,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:49:59,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:59,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:59,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:59,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash -679584198, now seen corresponding path program 12 times [2025-03-09 06:49:59,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:59,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62735493] [2025-03-09 06:49:59,769 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:59,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:59,776 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 110 statements into 22 equivalence classes. [2025-03-09 06:49:59,783 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 06:49:59,783 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2025-03-09 06:49:59,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 148 proven. 418 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-03-09 06:50:00,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:50:00,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62735493] [2025-03-09 06:50:00,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62735493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:50:00,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467192507] [2025-03-09 06:50:00,148 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:50:00,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:00,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:00,151 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:50:00,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2025-03-09 06:50:00,280 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 110 statements into 22 equivalence classes. [2025-03-09 06:50:00,428 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 06:50:00,428 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2025-03-09 06:50:00,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:00,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 06:50:00,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 142 proven. 410 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-03-09 06:50:00,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:50:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 142 proven. 509 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-09 06:50:02,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467192507] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:50:02,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:50:02,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 30] total 35 [2025-03-09 06:50:02,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207376160] [2025-03-09 06:50:02,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:50:02,734 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:50:02,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:50:02,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 06:50:02,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 06:50:02,735 INFO L87 Difference]: Start difference. First operand 4107 states and 10302 transitions. cyclomatic complexity: 6257 Second operand has 35 states, 31 states have (on average 2.193548387096774) internal successors, (68), 32 states have internal predecessors, (68), 19 states have call successors, (19), 1 states have call predecessors, (19), 14 states have return successors, (29), 16 states have call predecessors, (29), 19 states have call successors, (29) [2025-03-09 06:50:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:50:03,682 INFO L93 Difference]: Finished difference Result 5498 states and 13155 transitions. [2025-03-09 06:50:03,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5498 states and 13155 transitions. [2025-03-09 06:50:03,724 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 1056 [2025-03-09 06:50:03,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5498 states to 5410 states and 13030 transitions. [2025-03-09 06:50:03,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1806 [2025-03-09 06:50:03,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1806 [2025-03-09 06:50:03,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5410 states and 13030 transitions. [2025-03-09 06:50:03,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:03,787 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5410 states and 13030 transitions. [2025-03-09 06:50:03,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states and 13030 transitions. [2025-03-09 06:50:03,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 4285. [2025-03-09 06:50:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4285 states, 2377 states have (on average 1.0879259570887674) internal successors, (2586), 2320 states have internal predecessors, (2586), 1523 states have call successors, (1523), 473 states have call predecessors, (1523), 385 states have return successors, (6746), 1491 states have call predecessors, (6746), 1523 states have call successors, (6746) [2025-03-09 06:50:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 10855 transitions. [2025-03-09 06:50:03,914 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4285 states and 10855 transitions. [2025-03-09 06:50:03,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-09 06:50:03,916 INFO L432 stractBuchiCegarLoop]: Abstraction has 4285 states and 10855 transitions. [2025-03-09 06:50:03,916 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-03-09 06:50:03,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4285 states and 10855 transitions. [2025-03-09 06:50:03,936 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 860 [2025-03-09 06:50:03,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:50:03,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:50:03,937 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:50:03,937 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-09 06:50:03,937 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:50:03,938 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:50:03,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:03,938 INFO L85 PathProgramCache]: Analyzing trace with hash 704506179, now seen corresponding path program 11 times [2025-03-09 06:50:03,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:03,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246173051] [2025-03-09 06:50:03,938 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:50:03,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:03,946 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 102 statements into 10 equivalence classes. [2025-03-09 06:50:03,957 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:50:03,957 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-09 06:50:03,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:50:03,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1738665240] [2025-03-09 06:50:03,958 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:50:03,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:03,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:03,961 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:50:03,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2025-03-09 06:50:04,109 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 102 statements into 10 equivalence classes. [2025-03-09 06:50:04,140 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:50:04,140 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-09 06:50:04,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:04,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:04,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:50:04,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:50:04,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:04,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:04,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:50:04,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:04,190 INFO L85 PathProgramCache]: Analyzing trace with hash 210200174, now seen corresponding path program 13 times [2025-03-09 06:50:04,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:04,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94251748] [2025-03-09 06:50:04,190 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:50:04,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:04,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 06:50:04,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 06:50:04,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:04,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 67 proven. 175 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-09 06:50:04,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:50:04,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94251748] [2025-03-09 06:50:04,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94251748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:50:04,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655648694] [2025-03-09 06:50:04,414 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:50:04,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:04,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:04,417 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:50:04,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2025-03-09 06:50:04,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 06:50:04,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 06:50:04,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:04,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:04,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 06:50:04,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 60 proven. 168 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-09 06:50:04,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:50:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 60 proven. 202 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-09 06:50:05,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655648694] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:50:05,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:50:05,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 22] total 31 [2025-03-09 06:50:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052550886] [2025-03-09 06:50:05,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:50:05,392 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:50:05,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:50:05,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 06:50:05,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2025-03-09 06:50:05,393 INFO L87 Difference]: Start difference. First operand 4285 states and 10855 transitions. cyclomatic complexity: 6632 Second operand has 31 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (25), 16 states have call predecessors, (25), 18 states have call successors, (25) [2025-03-09 06:50:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:50:06,020 INFO L93 Difference]: Finished difference Result 5420 states and 13190 transitions. [2025-03-09 06:50:06,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5420 states and 13190 transitions. [2025-03-09 06:50:06,063 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 1099 [2025-03-09 06:50:06,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5420 states to 5409 states and 13157 transitions. [2025-03-09 06:50:06,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1863 [2025-03-09 06:50:06,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1863 [2025-03-09 06:50:06,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5409 states and 13157 transitions. [2025-03-09 06:50:06,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:06,124 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5409 states and 13157 transitions. [2025-03-09 06:50:06,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5409 states and 13157 transitions. [2025-03-09 06:50:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5409 to 4379. [2025-03-09 06:50:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4379 states, 2416 states have (on average 1.0865066225165563) internal successors, (2625), 2352 states have internal predecessors, (2625), 1582 states have call successors, (1582), 500 states have call predecessors, (1582), 381 states have return successors, (6809), 1526 states have call predecessors, (6809), 1582 states have call successors, (6809) [2025-03-09 06:50:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4379 states to 4379 states and 11016 transitions. [2025-03-09 06:50:06,339 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4379 states and 11016 transitions. [2025-03-09 06:50:06,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-09 06:50:06,340 INFO L432 stractBuchiCegarLoop]: Abstraction has 4379 states and 11016 transitions. [2025-03-09 06:50:06,340 INFO L338 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-03-09 06:50:06,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4379 states and 11016 transitions. [2025-03-09 06:50:06,361 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 890 [2025-03-09 06:50:06,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:50:06,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:50:06,362 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:50:06,362 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-09 06:50:06,362 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:50:06,362 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:50:06,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash 704506179, now seen corresponding path program 12 times [2025-03-09 06:50:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098872685] [2025-03-09 06:50:06,363 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:50:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:06,370 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 102 statements into 10 equivalence classes. [2025-03-09 06:50:06,384 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:50:06,384 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-09 06:50:06,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:50:06,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [965285694] [2025-03-09 06:50:06,385 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:50:06,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:06,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:06,391 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:50:06,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2025-03-09 06:50:06,547 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 102 statements into 10 equivalence classes. [2025-03-09 06:50:06,574 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:50:06,574 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-09 06:50:06,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:06,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:06,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:50:06,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:50:06,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:06,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:06,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:50:06,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1335732974, now seen corresponding path program 14 times [2025-03-09 06:50:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:06,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256040784] [2025-03-09 06:50:06,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:50:06,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:06,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 98 statements into 2 equivalence classes. [2025-03-09 06:50:06,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 06:50:06,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:50:06,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 116 proven. 333 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-09 06:50:06,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:50:06,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256040784] [2025-03-09 06:50:06,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256040784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:50:06,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949845513] [2025-03-09 06:50:06,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:50:06,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:06,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:06,865 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:50:06,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2025-03-09 06:50:07,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 98 statements into 2 equivalence classes. [2025-03-09 06:50:07,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 06:50:07,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:50:07,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:07,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 06:50:07,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 103 proven. 329 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-09 06:50:07,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:50:09,100 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 103 proven. 405 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-09 06:50:09,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949845513] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:50:09,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:50:09,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 30] total 38 [2025-03-09 06:50:09,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104593593] [2025-03-09 06:50:09,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:50:09,101 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:50:09,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:50:09,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-09 06:50:09,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2025-03-09 06:50:09,102 INFO L87 Difference]: Start difference. First operand 4379 states and 11016 transitions. cyclomatic complexity: 6699 Second operand has 38 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 22 states have call successors, (22), 1 states have call predecessors, (22), 14 states have return successors, (32), 19 states have call predecessors, (32), 22 states have call successors, (32) [2025-03-09 06:50:10,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:50:10,124 INFO L93 Difference]: Finished difference Result 5510 states and 13195 transitions. [2025-03-09 06:50:10,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5510 states and 13195 transitions. [2025-03-09 06:50:10,174 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 1081 [2025-03-09 06:50:10,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5510 states to 5488 states and 13173 transitions. [2025-03-09 06:50:10,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1849 [2025-03-09 06:50:10,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1849 [2025-03-09 06:50:10,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5488 states and 13173 transitions. [2025-03-09 06:50:10,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:10,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5488 states and 13173 transitions. [2025-03-09 06:50:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states and 13173 transitions. [2025-03-09 06:50:10,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 4461. [2025-03-09 06:50:10,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4461 states, 2468 states have (on average 1.0846839546191247) internal successors, (2677), 2402 states have internal predecessors, (2677), 1612 states have call successors, (1612), 527 states have call predecessors, (1612), 381 states have return successors, (6878), 1531 states have call predecessors, (6878), 1612 states have call successors, (6878) [2025-03-09 06:50:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4461 states to 4461 states and 11167 transitions. [2025-03-09 06:50:10,351 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4461 states and 11167 transitions. [2025-03-09 06:50:10,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-09 06:50:10,352 INFO L432 stractBuchiCegarLoop]: Abstraction has 4461 states and 11167 transitions. [2025-03-09 06:50:10,352 INFO L338 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2025-03-09 06:50:10,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4461 states and 11167 transitions. [2025-03-09 06:50:10,375 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 887 [2025-03-09 06:50:10,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:50:10,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:50:10,376 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:50:10,376 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 17, 17, 17, 17, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:50:10,376 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:50:10,376 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);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:50:10,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:10,377 INFO L85 PathProgramCache]: Analyzing trace with hash 704506179, now seen corresponding path program 13 times [2025-03-09 06:50:10,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:10,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734919512] [2025-03-09 06:50:10,377 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:50:10,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:10,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:50:10,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:50:10,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:10,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:50:10,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [234531038] [2025-03-09 06:50:10,388 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:50:10,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:10,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:10,392 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:50:10,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2025-03-09 06:50:10,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:50:10,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:50:10,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:10,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:10,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:10,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:50:10,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:50:10,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:10,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:10,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:50:10,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:10,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2108400018, now seen corresponding path program 15 times [2025-03-09 06:50:10,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:10,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010914840] [2025-03-09 06:50:10,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:50:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:10,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 24 equivalence classes. [2025-03-09 06:50:10,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) and asserted 104 of 122 statements. [2025-03-09 06:50:10,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2025-03-09 06:50:10,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 111 proven. 609 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-09 06:50:10,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:50:10,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010914840] [2025-03-09 06:50:10,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010914840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:50:10,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879736913] [2025-03-09 06:50:10,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:50:10,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:10,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:10,933 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:50:10,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2025-03-09 06:50:11,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 24 equivalence classes. [2025-03-09 06:50:11,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) and asserted 104 of 122 statements. [2025-03-09 06:50:11,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2025-03-09 06:50:11,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:11,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-09 06:50:11,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 111 proven. 594 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2025-03-09 06:50:11,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:50:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 111 proven. 708 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2025-03-09 06:50:14,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879736913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:50:14,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:50:14,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 32] total 40 [2025-03-09 06:50:14,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428146122] [2025-03-09 06:50:14,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:50:14,255 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:50:14,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:50:14,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 06:50:14,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 06:50:14,256 INFO L87 Difference]: Start difference. First operand 4461 states and 11167 transitions. cyclomatic complexity: 6768 Second operand has 40 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 15 states have return successors, (34), 20 states have call predecessors, (34), 23 states have call successors, (34) [2025-03-09 06:50:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:50:15,196 INFO L93 Difference]: Finished difference Result 6119 states and 15463 transitions. [2025-03-09 06:50:15,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6119 states and 15463 transitions. [2025-03-09 06:50:15,243 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 1192 [2025-03-09 06:50:15,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6119 states to 6100 states and 15435 transitions. [2025-03-09 06:50:15,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2084 [2025-03-09 06:50:15,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2102 [2025-03-09 06:50:15,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6100 states and 15435 transitions. [2025-03-09 06:50:15,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:15,298 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6100 states and 15435 transitions. [2025-03-09 06:50:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6100 states and 15435 transitions. [2025-03-09 06:50:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6100 to 4590. [2025-03-09 06:50:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4590 states, 2518 states have (on average 1.0830023828435267) internal successors, (2727), 2452 states have internal predecessors, (2727), 1666 states have call successors, (1666), 527 states have call predecessors, (1666), 406 states have return successors, (8011), 1610 states have call predecessors, (8011), 1666 states have call successors, (8011) [2025-03-09 06:50:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 4590 states and 12404 transitions. [2025-03-09 06:50:15,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4590 states and 12404 transitions. [2025-03-09 06:50:15,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-09 06:50:15,459 INFO L432 stractBuchiCegarLoop]: Abstraction has 4590 states and 12404 transitions. [2025-03-09 06:50:15,459 INFO L338 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2025-03-09 06:50:15,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4590 states and 12404 transitions. [2025-03-09 06:50:15,476 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 911 [2025-03-09 06:50:15,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:50:15,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:50:15,477 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:50:15,477 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-09 06:50:15,477 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:50:15,477 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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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-09 06:50:15,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash 704506179, now seen corresponding path program 14 times [2025-03-09 06:50:15,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:15,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499867455] [2025-03-09 06:50:15,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:50:15,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:15,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-03-09 06:50:15,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:50:15,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:50:15,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:50:15,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940149772] [2025-03-09 06:50:15,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:50:15,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:15,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:15,494 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:50:15,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2025-03-09 06:50:15,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-03-09 06:50:15,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:50:15,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:50:15,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:15,748 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:15,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:50:15,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:50:15,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:15,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:15,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:50:15,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash -340430636, now seen corresponding path program 16 times [2025-03-09 06:50:15,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:15,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774439747] [2025-03-09 06:50:15,790 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:50:15,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:15,796 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-03-09 06:50:15,799 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:50:15,799 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:50:15,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:50:15,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090708997] [2025-03-09 06:50:15,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:50:15,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:15,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:15,803 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-09 06:50:15,804 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-09 06:50:15,996 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-03-09 06:50:16,021 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:50:16,021 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:50:16,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:16,022 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:16,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:50:16,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:50:16,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:16,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:16,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:50:16,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:16,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1648461334, now seen corresponding path program 15 times [2025-03-09 06:50:16,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:16,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689544188] [2025-03-09 06:50:16,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:50:16,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:16,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 182 statements into 17 equivalence classes. [2025-03-09 06:50:16,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 107 of 182 statements. [2025-03-09 06:50:16,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 06:50:16,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:16,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1789 backedges. 494 proven. 236 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-03-09 06:50:16,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:50:16,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689544188] [2025-03-09 06:50:16,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689544188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:50:16,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113167043] [2025-03-09 06:50:16,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:50:16,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:16,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:16,348 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-09 06:50:16,349 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-09 06:50:16,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 182 statements into 17 equivalence classes. [2025-03-09 06:50:16,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 107 of 182 statements. [2025-03-09 06:50:16,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 06:50:16,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:16,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 06:50:16,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1789 backedges. 506 proven. 220 refuted. 0 times theorem prover too weak. 1063 trivial. 0 not checked. [2025-03-09 06:50:16,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:50:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1789 backedges. 493 proven. 248 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2025-03-09 06:50:17,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113167043] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:50:17,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:50:17,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 22] total 33 [2025-03-09 06:50:17,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45483384] [2025-03-09 06:50:17,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:50:17,774 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:50:17,774 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:50:17,774 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:50:17,774 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:50:17,774 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:50:17,774 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:17,774 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:50:17,774 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:50:17,775 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration32_Loop [2025-03-09 06:50:17,775 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:50:17,775 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:50:17,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,828 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:50:17,828 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:50:17,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:17,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:17,831 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:17,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-03-09 06:50:17,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:17,832 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:17,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2025-03-09 06:50:17,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:17,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:17,851 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:17,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-03-09 06:50:17,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:50:17,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:17,863 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:50:17,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2025-03-09 06:50:17,869 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:50:17,869 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:50:17,869 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:50:17,869 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:50:17,870 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:50:17,870 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:17,870 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:50:17,870 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:50:17,870 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration32_Loop [2025-03-09 06:50:17,870 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:50:17,870 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:50:17,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:17,948 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:50:17,948 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:50:17,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:17,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:17,951 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:17,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-03-09 06:50:17,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:50:17,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:17,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:17,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:17,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:17,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:17,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:17,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:17,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:17,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2025-03-09 06:50:17,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:17,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:17,970 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:17,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-03-09 06:50:17,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:50:17,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:17,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:17,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:17,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:17,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:17,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:17,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:17,984 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:50:17,986 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:50:17,986 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:50:17,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:17,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:17,988 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:17,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-03-09 06:50:17,989 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:50:17,989 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:50:17,989 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:50:17,989 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-09 06:50:17,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2025-03-09 06:50:17,995 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:50:18,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:18,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:50:18,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:50:18,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:18,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:18,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 06:50:18,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:18,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:50:18,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:50:18,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:18,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:18,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-09 06:50:18,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:18,612 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-09 06:50:18,613 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-09 06:50:18,613 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4590 states and 12404 transitions. cyclomatic complexity: 7876 Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-09 06:50:18,919 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4590 states and 12404 transitions. cyclomatic complexity: 7876. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 7734 states and 17271 transitions. Complement of second has 89 states. [2025-03-09 06:50:18,920 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-09 06:50:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-09 06:50:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 84 transitions. [2025-03-09 06:50:18,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 84 transitions. Stem has 102 letters. Loop has 80 letters. [2025-03-09 06:50:18,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:18,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 84 transitions. Stem has 182 letters. Loop has 80 letters. [2025-03-09 06:50:18,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:18,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 84 transitions. Stem has 102 letters. Loop has 160 letters. [2025-03-09 06:50:18,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:18,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7734 states and 17271 transitions. [2025-03-09 06:50:18,972 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 909 [2025-03-09 06:50:19,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7734 states to 5537 states and 13816 transitions. [2025-03-09 06:50:19,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1601 [2025-03-09 06:50:19,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1602 [2025-03-09 06:50:19,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5537 states and 13816 transitions. [2025-03-09 06:50:19,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:19,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5537 states and 13816 transitions. [2025-03-09 06:50:19,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5537 states and 13816 transitions. [2025-03-09 06:50:19,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5537 to 5114. [2025-03-09 06:50:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5114 states, 2848 states have (on average 1.0842696629213484) internal successors, (3088), 2782 states have internal predecessors, (3088), 1768 states have call successors, (1768), 601 states have call predecessors, (1768), 498 states have return successors, (8457), 1730 states have call predecessors, (8457), 1768 states have call successors, (8457) [2025-03-09 06:50:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 13313 transitions. [2025-03-09 06:50:19,145 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5114 states and 13313 transitions. [2025-03-09 06:50:19,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:50:19,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-09 06:50:19,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 06:50:19,146 INFO L87 Difference]: Start difference. First operand 5114 states and 13313 transitions. Second operand has 33 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 30 states have internal predecessors, (71), 19 states have call successors, (31), 1 states have call predecessors, (31), 8 states have return successors, (34), 19 states have call predecessors, (34), 19 states have call successors, (34) [2025-03-09 06:50:19,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2025-03-09 06:50:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:50:20,107 INFO L93 Difference]: Finished difference Result 7329 states and 19971 transitions. [2025-03-09 06:50:20,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7329 states and 19971 transitions. [2025-03-09 06:50:20,179 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 1732 [2025-03-09 06:50:20,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7329 states to 7190 states and 19514 transitions. [2025-03-09 06:50:20,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2511 [2025-03-09 06:50:20,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2511 [2025-03-09 06:50:20,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7190 states and 19514 transitions. [2025-03-09 06:50:20,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:20,275 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7190 states and 19514 transitions. [2025-03-09 06:50:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7190 states and 19514 transitions. [2025-03-09 06:50:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7190 to 5811. [2025-03-09 06:50:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5811 states, 3141 states have (on average 1.0865966252785737) internal successors, (3413), 3073 states have internal predecessors, (3413), 2152 states have call successors, (2152), 601 states have call predecessors, (2152), 518 states have return successors, (9564), 2136 states have call predecessors, (9564), 2152 states have call successors, (9564) [2025-03-09 06:50:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5811 states to 5811 states and 15129 transitions. [2025-03-09 06:50:20,457 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5811 states and 15129 transitions. [2025-03-09 06:50:20,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-09 06:50:20,458 INFO L432 stractBuchiCegarLoop]: Abstraction has 5811 states and 15129 transitions. [2025-03-09 06:50:20,458 INFO L338 stractBuchiCegarLoop]: ======== Iteration 33 ============ [2025-03-09 06:50:20,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5811 states and 15129 transitions. [2025-03-09 06:50:20,483 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 1096 [2025-03-09 06:50:20,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:50:20,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:50:20,484 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [18, 18, 10, 8, 8, 8, 8, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:50:20,484 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-09 06:50:20,484 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" [2025-03-09 06:50:20,484 INFO L754 eck$LassoCheckResult]: Loop: "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" [2025-03-09 06:50:20,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash 183904789, now seen corresponding path program 9 times [2025-03-09 06:50:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:20,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608422299] [2025-03-09 06:50:20,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:50:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:20,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 11 equivalence classes. [2025-03-09 06:50:20,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 122 statements. [2025-03-09 06:50:20,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:50:20,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 13 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2025-03-09 06:50:20,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:50:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608422299] [2025-03-09 06:50:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608422299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:50:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122333913] [2025-03-09 06:50:20,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:50:20,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:20,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:20,539 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-09 06:50:20,539 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-09 06:50:20,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 11 equivalence classes. [2025-03-09 06:50:20,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 122 statements. [2025-03-09 06:50:20,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:50:20,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:20,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:50:20,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 12 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-09 06:50:20,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:50:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 13 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2025-03-09 06:50:20,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122333913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:50:20,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:50:20,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 11 [2025-03-09 06:50:20,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907307467] [2025-03-09 06:50:20,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:50:20,929 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:50:20,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1003744170, now seen corresponding path program 6 times [2025-03-09 06:50:20,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:20,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589926520] [2025-03-09 06:50:20,929 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:50:20,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:20,934 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 6 equivalence classes. [2025-03-09 06:50:20,935 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:50:20,935 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-09 06:50:20,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:50:20,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [793679294] [2025-03-09 06:50:20,935 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:50:20,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:20,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:20,938 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-09 06:50:20,939 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-09 06:50:21,130 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 6 equivalence classes. [2025-03-09 06:50:21,137 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:50:21,137 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-09 06:50:21,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:21,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:21,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 06:50:21,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:50:21,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:21,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:21,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:50:21,298 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:50:21,298 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:50:21,298 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:50:21,298 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:50:21,298 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:50:21,298 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,298 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:50:21,298 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:50:21,298 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration33_Loop [2025-03-09 06:50:21,298 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:50:21,298 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:50:21,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,354 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:50:21,355 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:50:21,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:21,358 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:21,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-03-09 06:50:21,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:21,359 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:21,369 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:50:21,369 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-09 06:50:21,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2025-03-09 06:50:21,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:21,377 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:21,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-03-09 06:50:21,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:21,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:21,389 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:50:21,389 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=2} Honda state: {ULTIMATE.start_main_~n~0#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:50:21,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2025-03-09 06:50:21,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:21,397 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:21,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-03-09 06:50:21,399 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:21,399 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:21,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2025-03-09 06:50:21,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:21,420 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:21,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-03-09 06:50:21,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:50:21,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:21,486 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:50:21,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2025-03-09 06:50:21,491 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:50:21,491 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:50:21,491 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:50:21,491 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:50:21,491 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:50:21,491 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,491 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:50:21,491 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:50:21,491 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration33_Loop [2025-03-09 06:50:21,491 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:50:21,491 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:50:21,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,588 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:50:21,589 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:50:21,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:21,591 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-09 06:50:21,591 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-09 06:50:21,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:50:21,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:21,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:21,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:21,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:21,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:21,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:21,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:21,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:21,608 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-09 06:50:21,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:21,611 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-09 06:50:21,611 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-09 06:50:21,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:50:21,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:21,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:21,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:21,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:21,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:21,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:21,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:21,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:21,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2025-03-09 06:50:21,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:21,632 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-09 06:50:21,633 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-09 06:50:21,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:50:21,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:21,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:21,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:21,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:21,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:21,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:21,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:21,646 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:50:21,648 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:50:21,648 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:50:21,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:21,650 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-09 06:50:21,651 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-09 06:50:21,651 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:50:21,651 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:50:21,652 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:50:21,652 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_binomialCoefficient_~n#1) = -2*ULTIMATE.start_binomialCoefficient_~n#1 + 3 Supporting invariants [] [2025-03-09 06:50:21,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2025-03-09 06:50:21,657 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:50:21,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:21,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-09 06:50:21,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 06:50:21,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:21,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:21,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 06:50:21,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:22,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 06:50:22,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:50:22,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:22,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:22,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 06:50:22,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 38 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 06:50:22,312 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-09 06:50:22,312 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5811 states and 15129 transitions. cyclomatic complexity: 9384 Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 06:50:22,779 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5811 states and 15129 transitions. cyclomatic complexity: 9384. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Result 6039 states and 15365 transitions. Complement of second has 102 states. [2025-03-09 06:50:22,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 2 stem states 21 non-accepting loop states 1 accepting loop states [2025-03-09 06:50:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 06:50:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions. [2025-03-09 06:50:22,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 61 transitions. Stem has 122 letters. Loop has 38 letters. [2025-03-09 06:50:22,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:22,780 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:50:22,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:22,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-09 06:50:22,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 06:50:22,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:22,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:22,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 06:50:22,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:23,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 06:50:23,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:50:23,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:23,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:23,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 06:50:23,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 38 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 06:50:23,496 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2025-03-09 06:50:23,496 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5811 states and 15129 transitions. cyclomatic complexity: 9384 Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 06:50:24,087 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5811 states and 15129 transitions. cyclomatic complexity: 9384. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Result 15351 states and 33035 transitions. Complement of second has 140 states. [2025-03-09 06:50:24,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 2 stem states 21 non-accepting loop states 1 accepting loop states [2025-03-09 06:50:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 06:50:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 98 transitions. [2025-03-09 06:50:24,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 98 transitions. Stem has 122 letters. Loop has 38 letters. [2025-03-09 06:50:24,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:24,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 98 transitions. Stem has 160 letters. Loop has 38 letters. [2025-03-09 06:50:24,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:24,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 98 transitions. Stem has 122 letters. Loop has 76 letters. [2025-03-09 06:50:24,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:24,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15351 states and 33035 transitions. [2025-03-09 06:50:24,172 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-09 06:50:24,287 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 1077 [2025-03-09 06:50:24,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15351 states to 11932 states and 25974 transitions. [2025-03-09 06:50:24,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2673 [2025-03-09 06:50:24,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2802 [2025-03-09 06:50:24,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11932 states and 25974 transitions. [2025-03-09 06:50:24,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:24,444 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11932 states and 25974 transitions. [2025-03-09 06:50:24,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11932 states and 25974 transitions. [2025-03-09 06:50:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11932 to 10008. [2025-03-09 06:50:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10008 states, 5721 states have (on average 1.0825030589057858) internal successors, (6193), 5607 states have internal predecessors, (6193), 3134 states have call successors, (3161), 1181 states have call predecessors, (3161), 1153 states have return successors, (11363), 3219 states have call predecessors, (11363), 3134 states have call successors, (11363) [2025-03-09 06:50:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10008 states to 10008 states and 20717 transitions. [2025-03-09 06:50:24,726 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10008 states and 20717 transitions. [2025-03-09 06:50:24,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:50:24,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:50:24,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:50:24,727 INFO L87 Difference]: Start difference. First operand 10008 states and 20717 transitions. Second operand has 12 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 7 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-09 06:50:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:50:24,899 INFO L93 Difference]: Finished difference Result 11632 states and 25243 transitions. [2025-03-09 06:50:24,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11632 states and 25243 transitions. [2025-03-09 06:50:24,975 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 1113 [2025-03-09 06:50:25,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11632 states to 11565 states and 25126 transitions. [2025-03-09 06:50:25,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2497 [2025-03-09 06:50:25,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2497 [2025-03-09 06:50:25,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11565 states and 25126 transitions. [2025-03-09 06:50:25,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:25,079 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11565 states and 25126 transitions. [2025-03-09 06:50:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11565 states and 25126 transitions. [2025-03-09 06:50:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11565 to 10112. [2025-03-09 06:50:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10112 states, 5791 states have (on average 1.0825418753237783) internal successors, (6269), 5676 states have internal predecessors, (6269), 3168 states have call successors, (3195), 1181 states have call predecessors, (3195), 1153 states have return successors, (11435), 3254 states have call predecessors, (11435), 3168 states have call successors, (11435) [2025-03-09 06:50:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10112 states to 10112 states and 20899 transitions. [2025-03-09 06:50:25,392 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10112 states and 20899 transitions. [2025-03-09 06:50:25,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:50:25,392 INFO L432 stractBuchiCegarLoop]: Abstraction has 10112 states and 20899 transitions. [2025-03-09 06:50:25,393 INFO L338 stractBuchiCegarLoop]: ======== Iteration 34 ============ [2025-03-09 06:50:25,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10112 states and 20899 transitions. [2025-03-09 06:50:25,421 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 839 [2025-03-09 06:50:25,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:50:25,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:50:25,422 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 12, 10, 10, 10, 10, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:50:25,422 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-09 06:50:25,422 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;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#return;" [2025-03-09 06:50:25,423 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;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#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;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#return;" [2025-03-09 06:50:25,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:25,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1135885253, now seen corresponding path program 10 times [2025-03-09 06:50:25,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:25,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227762368] [2025-03-09 06:50:25,423 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:50:25,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:25,430 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 144 statements into 2 equivalence classes. [2025-03-09 06:50:25,433 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-09 06:50:25,433 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:50:25,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1042 backedges. 149 proven. 18 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2025-03-09 06:50:25,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:50:25,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227762368] [2025-03-09 06:50:25,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227762368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:50:25,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379432436] [2025-03-09 06:50:25,516 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:50:25,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:25,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:25,518 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:50:25,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2025-03-09 06:50:25,749 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 144 statements into 2 equivalence classes. [2025-03-09 06:50:25,771 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-09 06:50:25,771 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:50:25,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:25,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:50:25,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1042 backedges. 149 proven. 18 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2025-03-09 06:50:25,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:50:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1042 backedges. 149 proven. 19 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2025-03-09 06:50:25,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379432436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:50:25,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:50:25,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 14 [2025-03-09 06:50:25,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802819427] [2025-03-09 06:50:25,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:50:25,972 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:50:25,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:25,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1812096982, now seen corresponding path program 7 times [2025-03-09 06:50:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:25,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494988336] [2025-03-09 06:50:25,972 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:50:25,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:25,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 06:50:25,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:50:25,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:25,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:50:25,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [59840162] [2025-03-09 06:50:25,979 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:50:25,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:25,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:25,981 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:50:25,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2025-03-09 06:50:26,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 06:50:26,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:50:26,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:26,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:26,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:26,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 06:50:26,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:50:26,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:26,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:26,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:50:26,505 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:50:26,506 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:50:26,506 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:50:26,506 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:50:26,506 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:50:26,506 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,506 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:50:26,506 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:50:26,506 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration34_Loop [2025-03-09 06:50:26,506 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:50:26,506 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:50:26,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,564 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:50:26,564 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:50:26,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,566 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-09 06:50:26,567 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-09 06:50:26,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:26,568 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:26,578 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:50:26,578 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:50:26,584 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-09 06:50:26,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,586 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-09 06:50:26,587 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-09 06:50:26,588 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:26,588 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:26,598 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:50:26,599 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-09 06:50:26,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2025-03-09 06:50:26,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,606 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-09 06:50:26,607 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-09 06:50:26,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:26,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:26,625 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:50:26,625 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=-5} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:50:26,630 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-09 06:50:26,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,633 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-09 06:50:26,634 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-09 06:50:26,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:26,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:26,645 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:50:26,645 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-09 06:50:26,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2025-03-09 06:50:26,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,653 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-09 06:50:26,654 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-09 06:50:26,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:26,655 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:26,672 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:50:26,672 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-09 06:50:26,678 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-09 06:50:26,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,680 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-09 06:50:26,681 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-09 06:50:26,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:26,682 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:26,692 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:50:26,692 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-09 06:50:26,698 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-09 06:50:26,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,701 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-09 06:50:26,702 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-09 06:50:26,703 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:26,703 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:26,714 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:50:26,714 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=720} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=720} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:50:26,719 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-09 06:50:26,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,722 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-09 06:50:26,722 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-09 06:50:26,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:26,723 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:26,733 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:50:26,733 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:50:26,739 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-09 06:50:26,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,743 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-09 06:50:26,744 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-09 06:50:26,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:26,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:26,761 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-09 06:50:26,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,763 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-09 06:50:26,764 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-09 06:50:26,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:50:26,765 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:26,785 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:50:26,789 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-09 06:50:26,789 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:50:26,789 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:50:26,789 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:50:26,789 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:50:26,789 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:50:26,789 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,789 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:50:26,789 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:50:26,789 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration34_Loop [2025-03-09 06:50:26,790 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:50:26,790 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:50:26,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:26,854 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:50:26,854 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:50:26,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,857 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-09 06:50:26,858 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-09 06:50:26,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-09 06:50:26,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:26,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:26,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:26,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:26,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:26,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:26,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:26,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:26,876 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-09 06:50:26,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,878 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-09 06:50:26,879 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-09 06:50:26,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-09 06:50:26,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:26,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:26,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:26,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:26,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:26,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:26,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:26,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:26,897 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-09 06:50:26,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,899 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-09 06:50:26,901 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-09 06:50:26,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:50:26,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:26,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:26,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:26,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:26,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:26,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:26,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:26,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:26,919 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-09 06:50:26,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,923 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-09 06:50:26,924 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-09 06:50:26,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:50:26,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:26,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:26,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:26,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:26,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:26,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:26,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:26,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:26,942 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-09 06:50:26,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,945 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-09 06:50:26,946 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-09 06:50:26,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:50:26,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:26,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:26,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:26,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:26,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:26,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:26,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:26,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:26,963 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-09 06:50:26,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,966 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-09 06:50:26,966 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-09 06:50:26,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-09 06:50:26,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:26,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:26,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:26,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:26,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:26,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:26,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:26,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:26,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2025-03-09 06:50:26,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:26,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:26,986 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:26,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2025-03-09 06:50:26,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:50:26,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:26,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:26,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:26,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:26,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:26,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:26,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:27,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:27,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2025-03-09 06:50:27,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:27,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:27,008 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:27,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2025-03-09 06:50:27,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:50:27,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:27,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:27,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:27,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:27,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:27,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:27,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:27,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:27,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2025-03-09 06:50:27,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:27,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:27,030 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:27,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2025-03-09 06:50:27,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 06:50:27,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:27,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:27,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:27,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:27,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:27,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:27,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:27,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:27,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2025-03-09 06:50:27,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:27,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:27,051 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-09 06:50:27,052 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-09 06:50:27,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:50:27,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:27,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:27,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:27,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:27,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:27,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:27,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:27,064 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:50:27,065 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-09 06:50:27,066 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:50:27,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:27,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:27,068 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-09 06:50:27,069 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-09 06:50:27,069 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:50:27,069 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:50:27,069 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:50:27,069 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-09 06:50:27,075 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-09 06:50:27,075 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:50:27,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:27,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-09 06:50:27,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-09 06:50:27,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:27,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:27,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-09 06:50:27,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:27,397 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-09 06:50:27,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 06:50:27,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:50:27,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:27,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:27,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-09 06:50:27,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 75 proven. 73 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-09 06:50:27,903 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-09 06:50:27,903 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10112 states and 20899 transitions. cyclomatic complexity: 10885 Second operand has 18 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 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)