./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 e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-numeric/Binomial.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 23:14:21,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 23:14:21,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 23:14:21,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 23:14:21,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 23:14:21,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 23:14:21,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 23:14:21,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 23:14:21,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 23:14:21,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 23:14:21,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 23:14:21,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 23:14:21,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 23:14:21,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 23:14:21,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 23:14:21,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 23:14:21,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 23:14:21,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 23:14:21,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 23:14:21,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 23:14:21,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 23:14:21,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 23:14:21,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 23:14:21,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 23:14:21,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 23:14:21,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 23:14:21,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 23:14:21,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 23:14:21,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 23:14:21,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 23:14:21,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 23:14:21,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 23:14:21,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 23:14:21,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 23:14:21,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 23:14:21,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 23:14:21,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 23:14:21,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 23:14:21,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 23:14:21,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 23:14:21,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 23:14:21,557 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-15 23:14:21,586 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 23:14:21,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 23:14:21,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 23:14:21,587 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 23:14:21,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 23:14:21,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 23:14:21,589 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 23:14:21,589 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-15 23:14:21,589 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-15 23:14:21,590 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-15 23:14:21,590 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-15 23:14:21,591 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-15 23:14:21,591 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-15 23:14:21,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 23:14:21,591 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 23:14:21,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 23:14:21,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 23:14:21,592 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-15 23:14:21,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-15 23:14:21,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-15 23:14:21,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 23:14:21,592 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-15 23:14:21,592 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 23:14:21,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-15 23:14:21,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 23:14:21,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 23:14:21,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 23:14:21,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 23:14:21,595 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-15 23:14:21,596 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2023-02-15 23:14:21,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 23:14:21,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 23:14:21,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 23:14:21,919 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 23:14:21,919 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 23:14:21,920 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Binomial.c [2023-02-15 23:14:23,096 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 23:14:23,291 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 23:14:23,292 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2023-02-15 23:14:23,297 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b048560d5/abe0b808ad324d6a907b8f9f977969be/FLAGc3510790c [2023-02-15 23:14:23,310 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b048560d5/abe0b808ad324d6a907b8f9f977969be [2023-02-15 23:14:23,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 23:14:23,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 23:14:23,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 23:14:23,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 23:14:23,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 23:14:23,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:14:23" (1/1) ... [2023-02-15 23:14:23,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f99d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:23, skipping insertion in model container [2023-02-15 23:14:23,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:14:23" (1/1) ... [2023-02-15 23:14:23,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 23:14:23,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 23:14:23,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 23:14:23,464 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 23:14:23,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 23:14:23,489 INFO L208 MainTranslator]: Completed translation [2023-02-15 23:14:23,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:23 WrapperNode [2023-02-15 23:14:23,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 23:14:23,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 23:14:23,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 23:14:23,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 23:14:23,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:23" (1/1) ... [2023-02-15 23:14:23,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:23" (1/1) ... [2023-02-15 23:14:23,515 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2023-02-15 23:14:23,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 23:14:23,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 23:14:23,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 23:14:23,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 23:14:23,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:23" (1/1) ... [2023-02-15 23:14:23,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:23" (1/1) ... [2023-02-15 23:14:23,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:23" (1/1) ... [2023-02-15 23:14:23,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:23" (1/1) ... [2023-02-15 23:14:23,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:23" (1/1) ... [2023-02-15 23:14:23,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:23" (1/1) ... [2023-02-15 23:14:23,531 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:23" (1/1) ... [2023-02-15 23:14:23,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:23" (1/1) ... [2023-02-15 23:14:23,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 23:14:23,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 23:14:23,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 23:14:23,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 23:14:23,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:23" (1/1) ... [2023-02-15 23:14:23,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:23,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:23,564 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) [2023-02-15 23:14:23,574 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 [2023-02-15 23:14:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2023-02-15 23:14:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2023-02-15 23:14:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 23:14:23,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 23:14:23,639 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 23:14:23,640 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 23:14:23,748 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 23:14:23,757 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 23:14:23,758 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 23:14:23,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:14:23 BoogieIcfgContainer [2023-02-15 23:14:23,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 23:14:23,761 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-15 23:14:23,761 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-15 23:14:23,765 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-15 23:14:23,765 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 23:14:23,766 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.02 11:14:23" (1/3) ... [2023-02-15 23:14:23,766 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41811906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 11:14:23, skipping insertion in model container [2023-02-15 23:14:23,767 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 23:14:23,767 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:23" (2/3) ... [2023-02-15 23:14:23,767 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41811906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 11:14:23, skipping insertion in model container [2023-02-15 23:14:23,767 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 23:14:23,767 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:14:23" (3/3) ... [2023-02-15 23:14:23,769 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2023-02-15 23:14:23,857 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-15 23:14:23,872 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-15 23:14:23,873 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-15 23:14:23,873 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-15 23:14:23,873 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-15 23:14:23,873 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-15 23:14:23,873 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-15 23:14:23,874 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-15 23:14:23,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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) [2023-02-15 23:14:23,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2023-02-15 23:14:23,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:23,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:23,934 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 23:14:23,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 23:14:23,935 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-15 23:14:23,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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) [2023-02-15 23:14:23,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2023-02-15 23:14:23,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:23,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:23,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 23:14:23,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 23:14:23,948 INFO L748 eck$LassoCheckResult]: Stem: 26#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 14#L35true assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 27#L38true assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 11#L41-3true [2023-02-15 23:14:23,948 INFO L750 eck$LassoCheckResult]: Loop: 11#L41-3true assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 20#L42-3true assume !(main_~k~0#1 <= main_~x~0#1); 12#L41-2true main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 11#L41-3true [2023-02-15 23:14:23,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:23,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2023-02-15 23:14:23,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:23,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995631941] [2023-02-15 23:14:23,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:23,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:24,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:24,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:24,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash 57812, now seen corresponding path program 1 times [2023-02-15 23:14:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:24,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40224128] [2023-02-15 23:14:24,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:24,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:24,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:24,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:24,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:24,125 INFO L85 PathProgramCache]: Analyzing trace with hash 553673357, now seen corresponding path program 1 times [2023-02-15 23:14:24,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:24,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948335223] [2023-02-15 23:14:24,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:24,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:24,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:24,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948335223] [2023-02-15 23:14:24,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948335223] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:14:24,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:14:24,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 23:14:24,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056206480] [2023-02-15 23:14:24,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:14:24,272 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:24,272 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:24,273 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:24,273 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:24,273 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:24,273 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:24,273 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:24,273 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:24,274 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2023-02-15 23:14:24,274 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:24,274 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:24,287 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:24,296 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:24,348 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:24,349 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:24,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:24,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:24,355 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) [2023-02-15 23:14:24,356 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 [2023-02-15 23:14:24,358 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:24,358 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:24,369 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:24,369 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:24,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:24,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:24,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:24,380 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) [2023-02-15 23:14:24,381 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 [2023-02-15 23:14:24,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:24,383 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:24,411 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 [2023-02-15 23:14:24,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:24,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:24,413 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) [2023-02-15 23:14:24,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:24,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:24,429 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 [2023-02-15 23:14:24,573 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:24,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:24,577 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:24,577 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:24,577 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:24,578 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:24,578 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:24,578 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:24,578 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:24,578 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:24,578 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2023-02-15 23:14:24,578 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:24,578 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:24,579 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:24,593 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:24,631 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:24,635 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:24,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:24,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:24,641 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) [2023-02-15 23:14:24,644 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 [2023-02-15 23:14:24,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:24,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:24,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:24,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:24,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:24,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:24,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:24,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:24,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:24,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:24,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:24,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:24,679 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) [2023-02-15 23:14:24,683 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 [2023-02-15 23:14:24,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:24,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:24,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:24,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:24,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:24,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:24,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:24,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:24,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:24,729 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-15 23:14:24,729 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2023-02-15 23:14:24,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:24,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:24,732 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) [2023-02-15 23:14:24,734 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 [2023-02-15 23:14:24,736 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:24,737 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:24,737 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:24,737 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2023-02-15 23:14:24,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-02-15 23:14:24,746 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:24,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:24,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 23:14:24,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:24,796 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:14:24,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:24,885 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 [2023-02-15 23:14:24,887 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-02-15 23:14:24,971 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7). Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 73 states and 106 transitions. Complement of second has 11 states. [2023-02-15 23:14:24,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-02-15 23:14:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2023-02-15 23:14:24,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 3 letters. [2023-02-15 23:14:24,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:24,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 7 letters. Loop has 3 letters. [2023-02-15 23:14:24,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:24,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 6 letters. [2023-02-15 23:14:24,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:24,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 106 transitions. [2023-02-15 23:14:24,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2023-02-15 23:14:24,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 33 states and 48 transitions. [2023-02-15 23:14:24,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-02-15 23:14:24,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-02-15 23:14:24,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2023-02-15 23:14:24,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:24,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 48 transitions. [2023-02-15 23:14:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2023-02-15 23:14:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2023-02-15 23:14:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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) [2023-02-15 23:14:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2023-02-15 23:14:25,022 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 42 transitions. [2023-02-15 23:14:25,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:25,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 23:14:25,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 23:14:25,025 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-02-15 23:14:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:25,068 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-02-15 23:14:25,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2023-02-15 23:14:25,069 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-15 23:14:25,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 37 transitions. [2023-02-15 23:14:25,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-02-15 23:14:25,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-02-15 23:14:25,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2023-02-15 23:14:25,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 23:14:25,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-02-15 23:14:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2023-02-15 23:14:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-02-15 23:14:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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) [2023-02-15 23:14:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-02-15 23:14:25,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-02-15 23:14:25,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 23:14:25,076 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-02-15 23:14:25,076 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-15 23:14:25,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2023-02-15 23:14:25,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-15 23:14:25,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:25,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:25,078 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 23:14:25,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:25,079 INFO L748 eck$LassoCheckResult]: Stem: 243#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 231#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 232#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 238#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 234#L41-3 [2023-02-15 23:14:25,079 INFO L750 eck$LassoCheckResult]: Loop: 234#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 235#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 240#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 218#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 219#$Ultimate##0 ~n := #in~n; 241#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#74#return; 225#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 219#$Ultimate##0 ~n := #in~n; 241#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#76#return; 221#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 219#$Ultimate##0 ~n := #in~n; 241#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#78#return; 227#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 233#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 239#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 242#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 237#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 234#L41-3 [2023-02-15 23:14:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:25,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2023-02-15 23:14:25,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:25,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717801898] [2023-02-15 23:14:25,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:25,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:25,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:25,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:25,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1284911041, now seen corresponding path program 1 times [2023-02-15 23:14:25,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:25,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254832878] [2023-02-15 23:14:25,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:25,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:25,103 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:25,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1493437114] [2023-02-15 23:14:25,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:25,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:25,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:25,106 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:25,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 23:14:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:25,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 23:14:25,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 23:14:25,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 23:14:25,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:25,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254832878] [2023-02-15 23:14:25,243 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:14:25,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493437114] [2023-02-15 23:14:25,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493437114] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:14:25,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:14:25,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 23:14:25,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690399925] [2023-02-15 23:14:25,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:14:25,244 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:14:25,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:25,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 23:14:25,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 23:14:25,245 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 23:14:25,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:25,328 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2023-02-15 23:14:25,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2023-02-15 23:14:25,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2023-02-15 23:14:25,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2023-02-15 23:14:25,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-02-15 23:14:25,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-02-15 23:14:25,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2023-02-15 23:14:25,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 23:14:25,343 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2023-02-15 23:14:25,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2023-02-15 23:14:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2023-02-15 23:14:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-02-15 23:14:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2023-02-15 23:14:25,355 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2023-02-15 23:14:25,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 23:14:25,357 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2023-02-15 23:14:25,357 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-15 23:14:25,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2023-02-15 23:14:25,359 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-15 23:14:25,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:25,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:25,361 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 23:14:25,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:25,361 INFO L748 eck$LassoCheckResult]: Stem: 380#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 366#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 367#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 374#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 370#L41-3 [2023-02-15 23:14:25,362 INFO L750 eck$LassoCheckResult]: Loop: 370#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 371#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 376#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 354#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 355#$Ultimate##0 ~n := #in~n; 378#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#74#return; 362#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 355#$Ultimate##0 ~n := #in~n; 378#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#76#return; 358#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 355#$Ultimate##0 ~n := #in~n; 378#L25 assume !(~n <= 0); 360#L26 call #t~ret0 := fact(~n - 1);< 355#$Ultimate##0 ~n := #in~n; 378#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#66#return; 364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 377#factFINAL assume true; 381#factEXIT >#78#return; 368#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 369#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 375#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 379#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 373#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 370#L41-3 [2023-02-15 23:14:25,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:25,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2023-02-15 23:14:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:25,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224150544] [2023-02-15 23:14:25,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:25,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:25,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:25,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1183838151, now seen corresponding path program 1 times [2023-02-15 23:14:25,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:25,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209044681] [2023-02-15 23:14:25,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:25,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:25,382 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:25,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1243232720] [2023-02-15 23:14:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:25,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:25,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:25,389 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:25,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 23:14:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:25,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:25,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:25,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:25,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2107943858, now seen corresponding path program 1 times [2023-02-15 23:14:25,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:25,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329949055] [2023-02-15 23:14:25,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:25,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:25,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:25,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329949055] [2023-02-15 23:14:25,481 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 23:14:25,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496145784] [2023-02-15 23:14:25,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:25,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:25,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:25,490 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) [2023-02-15 23:14:25,497 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 [2023-02-15 23:14:25,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 23:14:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:25,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 23:14:25,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 23:14:25,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 23:14:25,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496145784] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:14:25,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:14:25,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 23:14:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565997135] [2023-02-15 23:14:25,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:14:25,900 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:25,900 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:25,900 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:25,900 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:25,900 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:25,900 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:25,901 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:25,901 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:25,901 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2023-02-15 23:14:25,901 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:25,901 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:25,902 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:25,905 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:25,923 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:25,926 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:25,928 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:25,930 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:25,932 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:25,934 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:26,094 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:26,094 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:26,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,105 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:26,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:26,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:26,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-02-15 23:14:26,128 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:26,128 INFO L440 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: [] [2023-02-15 23:14:26,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:26,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,141 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) [2023-02-15 23:14:26,153 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:26,153 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:26,166 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 [2023-02-15 23:14:26,174 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 [2023-02-15 23:14:26,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,176 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) [2023-02-15 23:14:26,178 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 [2023-02-15 23:14:26,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:26,203 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:26,230 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:26,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:26,237 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:26,237 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:26,237 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:26,237 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:26,237 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:26,237 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,237 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:26,238 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:26,238 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2023-02-15 23:14:26,238 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:26,238 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:26,239 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:26,243 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:26,262 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:26,264 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:26,266 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:26,268 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:26,270 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:26,272 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:26,451 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:26,451 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:26,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,454 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) [2023-02-15 23:14:26,456 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 [2023-02-15 23:14:26,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:26,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:26,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:26,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:26,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:26,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:26,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:26,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:26,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:26,487 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 [2023-02-15 23:14:26,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,489 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) [2023-02-15 23:14:26,492 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 [2023-02-15 23:14:26,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 [2023-02-15 23:14:26,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:26,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:26,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:26,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:26,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:26,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:26,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:26,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:26,535 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 [2023-02-15 23:14:26,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,536 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) [2023-02-15 23:14:26,538 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 [2023-02-15 23:14:26,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:26,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:26,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:26,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:26,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:26,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:26,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:26,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:26,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:26,560 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 [2023-02-15 23:14:26,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,561 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) [2023-02-15 23:14:26,567 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 [2023-02-15 23:14:26,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:26,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:26,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:26,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:26,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:26,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:26,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:26,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:26,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:26,593 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 [2023-02-15 23:14:26,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,595 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) [2023-02-15 23:14:26,602 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 [2023-02-15 23:14:26,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 [2023-02-15 23:14:26,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:26,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:26,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:26,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:26,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:26,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:26,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:26,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:26,640 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 [2023-02-15 23:14:26,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,642 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) [2023-02-15 23:14:26,656 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 [2023-02-15 23:14:26,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:26,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:26,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:26,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:26,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:26,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:26,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:26,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:26,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:26,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:26,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,703 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) [2023-02-15 23:14:26,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:26,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:26,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:26,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:26,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:26,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:26,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:26,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:26,734 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 [2023-02-15 23:14:26,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:26,753 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 [2023-02-15 23:14:26,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,755 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) [2023-02-15 23:14:26,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:26,768 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 [2023-02-15 23:14:26,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:26,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:26,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:26,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:26,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:26,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:26,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:26,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:26,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:26,791 INFO L490 LassoAnalysis]: Using template '2-nested'. [2023-02-15 23:14:26,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,793 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) [2023-02-15 23:14:26,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:26,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:26,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:26,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:26,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:26,811 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:26,811 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 [2023-02-15 23:14:26,812 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:26,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:26,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:26,832 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 [2023-02-15 23:14:26,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,834 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:26,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:26,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:26,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:26,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:26,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:26,850 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:26,854 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:26,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:26,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-02-15 23:14:26,869 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:26,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:26,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,877 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:26,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:26,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:26,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:26,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:26,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:26,902 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:26,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-02-15 23:14:26,903 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:26,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:26,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:26,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:26,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,930 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:26,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-02-15 23:14:26,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:26,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:26,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:26,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:26,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:26,951 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:26,952 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:26,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:26,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:26,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-02-15 23:14:26,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:26,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:26,974 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:26,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-02-15 23:14:26,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:26,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:26,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:26,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:26,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:26,993 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:26,993 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:26,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:27,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,013 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:27,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-02-15 23:14:27,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,037 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:27,038 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:27,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:27,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,056 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) [2023-02-15 23:14:27,057 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 [2023-02-15 23:14:27,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,068 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:27,069 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:27,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,073 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 [2023-02-15 23:14:27,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,074 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) [2023-02-15 23:14:27,076 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 [2023-02-15 23:14:27,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,084 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:27,085 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:27,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:27,096 INFO L490 LassoAnalysis]: Using template '3-nested'. [2023-02-15 23:14:27,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,098 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) [2023-02-15 23:14:27,099 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 [2023-02-15 23:14:27,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,109 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:27,110 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:27,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:27,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,141 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) [2023-02-15 23:14:27,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,155 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:27,155 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 [2023-02-15 23:14:27,161 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:27,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,177 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 [2023-02-15 23:14:27,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,179 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) [2023-02-15 23:14:27,183 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 [2023-02-15 23:14:27,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,190 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:27,191 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:27,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:27,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,199 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) [2023-02-15 23:14:27,201 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 [2023-02-15 23:14:27,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,209 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:27,210 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:27,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:27,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,229 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) [2023-02-15 23:14:27,231 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 [2023-02-15 23:14:27,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,239 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:27,239 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:27,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,255 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 [2023-02-15 23:14:27,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,257 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) [2023-02-15 23:14:27,257 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 [2023-02-15 23:14:27,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,272 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:27,272 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:27,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,292 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 [2023-02-15 23:14:27,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,297 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) [2023-02-15 23:14:27,300 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 [2023-02-15 23:14:27,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,333 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:27,334 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:27,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,339 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 [2023-02-15 23:14:27,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,341 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) [2023-02-15 23:14:27,342 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 [2023-02-15 23:14:27,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,351 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:27,352 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:27,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,359 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 [2023-02-15 23:14:27,359 INFO L490 LassoAnalysis]: Using template '4-nested'. [2023-02-15 23:14:27,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,360 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) [2023-02-15 23:14:27,361 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 [2023-02-15 23:14:27,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,370 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:27,371 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:27,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:27,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,404 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) [2023-02-15 23:14:27,413 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 [2023-02-15 23:14:27,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,445 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:27,450 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:27,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:27,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,472 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) [2023-02-15 23:14:27,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,488 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:27,490 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:27,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,492 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 [2023-02-15 23:14:27,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,512 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 [2023-02-15 23:14:27,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,513 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) [2023-02-15 23:14:27,514 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 [2023-02-15 23:14:27,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,524 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:27,524 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:27,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:27,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,538 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:27,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-02-15 23:14:27,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,552 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:27,558 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:27,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:27,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,577 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) [2023-02-15 23:14:27,581 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 [2023-02-15 23:14:27,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,590 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:27,591 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:27,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,616 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 [2023-02-15 23:14:27,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,617 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) [2023-02-15 23:14:27,624 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 [2023-02-15 23:14:27,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 [2023-02-15 23:14:27,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,631 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:27,632 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:27,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2023-02-15 23:14:27,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,648 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) [2023-02-15 23:14:27,649 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 [2023-02-15 23:14:27,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:27,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,658 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:27,660 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:27,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,667 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 [2023-02-15 23:14:27,668 INFO L490 LassoAnalysis]: Using template '2-phase'. [2023-02-15 23:14:27,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,669 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) [2023-02-15 23:14:27,671 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 [2023-02-15 23:14:27,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,743 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:27,743 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:27,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,743 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:27,744 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:27,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,749 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 [2023-02-15 23:14:27,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,750 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) [2023-02-15 23:14:27,752 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 [2023-02-15 23:14:27,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,761 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:27,761 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:27,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,762 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:27,765 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:27,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,797 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 [2023-02-15 23:14:27,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,799 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) [2023-02-15 23:14:27,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,817 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 [2023-02-15 23:14:27,817 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:27,817 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:27,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,818 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:27,818 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:27,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,845 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 [2023-02-15 23:14:27,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,846 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) [2023-02-15 23:14:27,848 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 [2023-02-15 23:14:27,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,856 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:27,856 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:27,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,856 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:27,857 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:27,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2023-02-15 23:14:27,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,863 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) [2023-02-15 23:14:27,865 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 [2023-02-15 23:14:27,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,873 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:27,873 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:27,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,873 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:27,874 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:27,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,897 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 [2023-02-15 23:14:27,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,898 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) [2023-02-15 23:14:27,900 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 [2023-02-15 23:14:27,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 [2023-02-15 23:14:27,908 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:27,908 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:27,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,908 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:27,909 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:27,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:27,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,915 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) [2023-02-15 23:14:27,924 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 [2023-02-15 23:14:27,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 [2023-02-15 23:14:27,932 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:27,932 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:27,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,932 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:27,933 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:27,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:27,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,941 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) [2023-02-15 23:14:27,943 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 [2023-02-15 23:14:27,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,951 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:27,951 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:27,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,951 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 23:14:27,952 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 23:14:27,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,957 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 [2023-02-15 23:14:27,958 INFO L490 LassoAnalysis]: Using template '3-phase'. [2023-02-15 23:14:27,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:27,959 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) [2023-02-15 23:14:27,960 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 [2023-02-15 23:14:27,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:27,969 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:27,969 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 23:14:27,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:27,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:27,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:27,970 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:27,971 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:27,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:27,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:27,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:27,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:27,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,000 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:28,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-02-15 23:14:28,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,057 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,058 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 23:14:28,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,058 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,062 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,085 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:28,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,097 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,097 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 23:14:28,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,098 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,099 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-02-15 23:14:28,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,118 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:28,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-02-15 23:14:28,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,143 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,143 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 23:14:28,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,143 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,144 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,158 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,164 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:28,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-02-15 23:14:28,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,176 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,177 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 23:14:28,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,177 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,178 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2023-02-15 23:14:28,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,192 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:28,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-02-15 23:14:28,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,202 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,202 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 23:14:28,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,203 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,203 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2023-02-15 23:14:28,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,225 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:28,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,242 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,242 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 23:14:28,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,242 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,243 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-02-15 23:14:28,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,262 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) [2023-02-15 23:14:28,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,277 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,277 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 23:14:28,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,278 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,279 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,284 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 [2023-02-15 23:14:28,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,305 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 [2023-02-15 23:14:28,305 INFO L490 LassoAnalysis]: Using template '4-phase'. [2023-02-15 23:14:28,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,306 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) [2023-02-15 23:14:28,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,322 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,322 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,323 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:28,322 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 [2023-02-15 23:14:28,324 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:28,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,342 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 [2023-02-15 23:14:28,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,344 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) [2023-02-15 23:14:28,346 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 [2023-02-15 23:14:28,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,357 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,358 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,358 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:28,364 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:28,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,394 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 [2023-02-15 23:14:28,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,396 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) [2023-02-15 23:14:28,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,409 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,410 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,410 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:28,411 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:28,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,415 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 [2023-02-15 23:14:28,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,439 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) [2023-02-15 23:14:28,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,453 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,454 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,454 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:28,455 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:28,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,459 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 [2023-02-15 23:14:28,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,474 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:28,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-02-15 23:14:28,489 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,489 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,489 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:28,490 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:28,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,512 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:28,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,525 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,526 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,526 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:28,527 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:28,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-02-15 23:14:28,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,558 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:28,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2023-02-15 23:14:28,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,571 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,571 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,571 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:28,573 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:28,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,606 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:28,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,622 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,622 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,622 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 23:14:28,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2023-02-15 23:14:28,624 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 23:14:28,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,657 INFO L490 LassoAnalysis]: Using template '2-lex'. [2023-02-15 23:14:28,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,658 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:28,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2023-02-15 23:14:28,673 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,673 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:28,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,674 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,674 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,694 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:28,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,710 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,710 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:28,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,710 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,714 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2023-02-15 23:14:28,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2023-02-15 23:14:28,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,726 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:28,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2023-02-15 23:14:28,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,736 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,736 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:28,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,737 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,737 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2023-02-15 23:14:28,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,743 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:28,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2023-02-15 23:14:28,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,754 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,755 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:28,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,755 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,755 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,761 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) [2023-02-15 23:14:28,762 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 [2023-02-15 23:14:28,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,770 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,771 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:28,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,771 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,772 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,774 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,777 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 [2023-02-15 23:14:28,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,778 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) [2023-02-15 23:14:28,779 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 [2023-02-15 23:14:28,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,787 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,788 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:28,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,788 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,788 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,793 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 [2023-02-15 23:14:28,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,794 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) [2023-02-15 23:14:28,796 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 [2023-02-15 23:14:28,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,804 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,804 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:28,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,804 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,805 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,809 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 [2023-02-15 23:14:28,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,811 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) [2023-02-15 23:14:28,811 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 [2023-02-15 23:14:28,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,822 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,823 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 23:14:28,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,823 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 23:14:28,824 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 23:14:28,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,829 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 [2023-02-15 23:14:28,829 INFO L490 LassoAnalysis]: Using template '3-lex'. [2023-02-15 23:14:28,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,831 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) [2023-02-15 23:14:28,831 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 [2023-02-15 23:14:28,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,841 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,841 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,841 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 23:14:28,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:14:28,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,853 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) [2023-02-15 23:14:28,855 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 [2023-02-15 23:14:28,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,864 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,864 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,864 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 23:14:28,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:14:28,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,888 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) [2023-02-15 23:14:28,889 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 [2023-02-15 23:14:28,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,897 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,897 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,898 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 23:14:28,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:14:28,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,906 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) [2023-02-15 23:14:28,906 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 [2023-02-15 23:14:28,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,915 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,916 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,916 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 23:14:28,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:14:28,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,924 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 [2023-02-15 23:14:28,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,925 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) [2023-02-15 23:14:28,927 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 [2023-02-15 23:14:28,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,935 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,935 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,936 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 23:14:28,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:14:28,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:28,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,944 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) [2023-02-15 23:14:28,944 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 [2023-02-15 23:14:28,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,953 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,954 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,954 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 23:14:28,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:14:28,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,960 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 [2023-02-15 23:14:28,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,962 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) [2023-02-15 23:14:28,962 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 [2023-02-15 23:14:28,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,971 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,972 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,972 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 23:14:28,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:14:28,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:28,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:28,978 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 [2023-02-15 23:14:28,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:28,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:28,979 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) [2023-02-15 23:14:28,981 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 [2023-02-15 23:14:28,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:28,997 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 23:14:28,997 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 23:14:28,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:28,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:28,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:28,997 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 23:14:28,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 23:14:28,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:29,009 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:29,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:29,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:29,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 23:14:29,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 23:14:29,014 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 23:14:29,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:29,049 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2023-02-15 23:14:29,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 55 transitions. [2023-02-15 23:14:29,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2023-02-15 23:14:29,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 55 transitions. [2023-02-15 23:14:29,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2023-02-15 23:14:29,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2023-02-15 23:14:29,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 55 transitions. [2023-02-15 23:14:29,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 23:14:29,053 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 55 transitions. [2023-02-15 23:14:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 55 transitions. [2023-02-15 23:14:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2023-02-15 23:14:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-02-15 23:14:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2023-02-15 23:14:29,056 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-02-15 23:14:29,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 23:14:29,058 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-02-15 23:14:29,058 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-15 23:14:29,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2023-02-15 23:14:29,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-02-15 23:14:29,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:29,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:29,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 23:14:29,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:29,060 INFO L748 eck$LassoCheckResult]: Stem: 548#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 534#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 535#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 542#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 538#L41-3 [2023-02-15 23:14:29,060 INFO L750 eck$LassoCheckResult]: Loop: 538#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 539#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 544#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 530#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545#factFINAL assume true; 550#factEXIT >#68#return; 528#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545#factFINAL assume true; 550#factEXIT >#70#return; 524#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545#factFINAL assume true; 550#factEXIT >#72#return; 532#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 540#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 543#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 547#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 541#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 538#L41-3 [2023-02-15 23:14:29,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:29,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 4 times [2023-02-15 23:14:29,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:29,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934622675] [2023-02-15 23:14:29,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:29,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:29,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:29,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:29,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:29,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1909923709, now seen corresponding path program 1 times [2023-02-15 23:14:29,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:29,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156315907] [2023-02-15 23:14:29,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:29,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:29,076 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:29,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [665031565] [2023-02-15 23:14:29,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:29,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:29,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:29,078 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:29,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2023-02-15 23:14:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:29,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:14:29,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 47 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 23:14:29,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:29,233 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-02-15 23:14:29,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:29,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156315907] [2023-02-15 23:14:29,234 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:14:29,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665031565] [2023-02-15 23:14:29,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665031565] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:29,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:14:29,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-02-15 23:14:29,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318768237] [2023-02-15 23:14:29,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:29,235 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:14:29,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:29,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 23:14:29,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 23:14:29,235 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 16 Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-15 23:14:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:29,359 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2023-02-15 23:14:29,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 62 transitions. [2023-02-15 23:14:29,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2023-02-15 23:14:29,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 62 transitions. [2023-02-15 23:14:29,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2023-02-15 23:14:29,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2023-02-15 23:14:29,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2023-02-15 23:14:29,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 23:14:29,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2023-02-15 23:14:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2023-02-15 23:14:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2023-02-15 23:14:29,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2023-02-15 23:14:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2023-02-15 23:14:29,380 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 48 transitions. [2023-02-15 23:14:29,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 23:14:29,385 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 48 transitions. [2023-02-15 23:14:29,385 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-15 23:14:29,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 48 transitions. [2023-02-15 23:14:29,387 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2023-02-15 23:14:29,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:29,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:29,389 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 23:14:29,389 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:29,389 INFO L748 eck$LassoCheckResult]: Stem: 875#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 860#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 861#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 868#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 864#L41-3 [2023-02-15 23:14:29,389 INFO L750 eck$LassoCheckResult]: Loop: 864#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 865#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 870#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 855#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 847#$Ultimate##0 ~n := #in~n; 874#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#68#return; 851#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 847#$Ultimate##0 ~n := #in~n; 874#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#70#return; 848#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 847#$Ultimate##0 ~n := #in~n; 874#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#72#return; 858#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 866#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 869#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 872#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 867#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 864#L41-3 [2023-02-15 23:14:29,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 5 times [2023-02-15 23:14:29,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:29,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731321932] [2023-02-15 23:14:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:29,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:29,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:29,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:29,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:29,402 INFO L85 PathProgramCache]: Analyzing trace with hash -743603515, now seen corresponding path program 1 times [2023-02-15 23:14:29,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:29,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628311365] [2023-02-15 23:14:29,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:29,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:29,415 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:29,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501543991] [2023-02-15 23:14:29,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:29,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:29,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:29,422 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:29,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2023-02-15 23:14:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:29,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:29,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:29,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:29,462 INFO L85 PathProgramCache]: Analyzing trace with hash 343305470, now seen corresponding path program 1 times [2023-02-15 23:14:29,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:29,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257044841] [2023-02-15 23:14:29,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:29,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:29,472 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:29,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885875643] [2023-02-15 23:14:29,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:29,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:29,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:29,488 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:29,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2023-02-15 23:14:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:29,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:29,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:29,757 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:29,757 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:29,757 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:29,757 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:29,757 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:29,757 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:29,757 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:29,757 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:29,758 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2023-02-15 23:14:29,758 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:29,758 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:29,759 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:29,761 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:29,774 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:29,777 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:29,778 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:29,780 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:29,783 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:29,785 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:29,857 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:29,857 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:29,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:29,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:29,869 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) [2023-02-15 23:14:29,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:29,882 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:29,885 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 [2023-02-15 23:14:29,903 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:29,903 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9#1=0} Honda state: {ULTIMATE.start_main_#t~ret9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:29,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:29,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:29,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:29,908 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) [2023-02-15 23:14:29,910 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 [2023-02-15 23:14:29,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:29,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:29,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:29,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:29,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:29,945 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:29,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:29,953 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:29,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2023-02-15 23:14:30,345 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:30,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:30,351 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:30,351 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:30,351 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:30,351 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:30,351 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:30,351 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:30,351 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:30,351 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:30,351 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2023-02-15 23:14:30,351 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:30,351 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:30,352 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:30,358 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:30,372 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:30,375 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:30,380 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:30,382 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:30,383 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:30,385 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:30,463 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:30,463 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:30,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:30,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:30,465 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:30,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2023-02-15 23:14:30,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:30,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:30,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:30,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:30,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:30,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:30,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:30,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:30,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:30,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2023-02-15 23:14:30,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:30,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:30,480 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:30,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2023-02-15 23:14:30,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:30,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:30,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:30,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:30,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:30,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:30,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:30,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:30,494 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:30,497 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-15 23:14:30,497 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:14:30,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:30,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:30,513 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:30,514 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:30,514 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:30,514 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:30,514 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 1 Supporting invariants [] [2023-02-15 23:14:30,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2023-02-15 23:14:30,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:30,520 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:30,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:30,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 23:14:30,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:30,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 23:14:30,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 23:14:30,703 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 [2023-02-15 23:14:30,704 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 19 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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) [2023-02-15 23:14:30,932 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 19. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 123 states and 190 transitions. Complement of second has 26 states. [2023-02-15 23:14:30,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:30,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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) [2023-02-15 23:14:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2023-02-15 23:14:30,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 23 letters. [2023-02-15 23:14:30,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:30,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 27 letters. Loop has 23 letters. [2023-02-15 23:14:30,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:30,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 46 letters. [2023-02-15 23:14:30,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:30,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 190 transitions. [2023-02-15 23:14:30,939 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-02-15 23:14:30,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 122 states and 189 transitions. [2023-02-15 23:14:30,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2023-02-15 23:14:30,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2023-02-15 23:14:30,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 189 transitions. [2023-02-15 23:14:30,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:30,943 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 189 transitions. [2023-02-15 23:14:30,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 189 transitions. [2023-02-15 23:14:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2023-02-15 23:14:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 76 states have internal predecessors, (86), 36 states have call successors, (36), 6 states have call predecessors, (36), 10 states have return successors, (58), 34 states have call predecessors, (58), 36 states have call successors, (58) [2023-02-15 23:14:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2023-02-15 23:14:30,953 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 180 transitions. [2023-02-15 23:14:30,953 INFO L428 stractBuchiCegarLoop]: Abstraction has 117 states and 180 transitions. [2023-02-15 23:14:30,953 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-15 23:14:30,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 180 transitions. [2023-02-15 23:14:30,954 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-02-15 23:14:30,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:30,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:30,955 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 23:14:30,955 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:30,955 INFO L748 eck$LassoCheckResult]: Stem: 1203#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1164#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1165#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1182#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1204#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1173#L42-3 [2023-02-15 23:14:30,956 INFO L750 eck$LassoCheckResult]: Loop: 1173#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1191#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1215#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1222#$Ultimate##0 ~n := #in~n; 1228#L25 assume !(~n <= 0); 1138#L26 call #t~ret0 := fact(~n - 1);< 1170#$Ultimate##0 ~n := #in~n; 1189#L25 assume ~n <= 0;#res := 1; 1154#factFINAL assume true; 1137#factEXIT >#66#return; 1141#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1225#factFINAL assume true; 1213#factEXIT >#68#return; 1218#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1222#$Ultimate##0 ~n := #in~n; 1228#L25 assume ~n <= 0;#res := 1; 1226#factFINAL assume true; 1223#factEXIT >#70#return; 1217#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1222#$Ultimate##0 ~n := #in~n; 1228#L25 assume ~n <= 0;#res := 1; 1226#factFINAL assume true; 1223#factEXIT >#72#return; 1212#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1210#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1208#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1206#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1180#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1172#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1173#L42-3 [2023-02-15 23:14:30,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:30,956 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2023-02-15 23:14:30,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:30,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067757093] [2023-02-15 23:14:30,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:30,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:30,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:30,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:30,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:30,963 INFO L85 PathProgramCache]: Analyzing trace with hash -304298247, now seen corresponding path program 2 times [2023-02-15 23:14:30,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:30,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929036555] [2023-02-15 23:14:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:30,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:30,968 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:30,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [933772286] [2023-02-15 23:14:30,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:14:30,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:30,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:30,970 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) [2023-02-15 23:14:30,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2023-02-15 23:14:31,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:14:31,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:14:31,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 23:14:31,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:31,063 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 23:14:31,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 23:14:31,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:31,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929036555] [2023-02-15 23:14:31,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:14:31,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933772286] [2023-02-15 23:14:31,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933772286] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:31,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:14:31,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-02-15 23:14:31,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670152686] [2023-02-15 23:14:31,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:31,190 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:14:31,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:31,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 23:14:31,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-15 23:14:31,191 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. cyclomatic complexity: 68 Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 23:14:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:31,423 INFO L93 Difference]: Finished difference Result 249 states and 362 transitions. [2023-02-15 23:14:31,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 362 transitions. [2023-02-15 23:14:31,426 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 87 [2023-02-15 23:14:31,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 249 states and 362 transitions. [2023-02-15 23:14:31,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2023-02-15 23:14:31,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2023-02-15 23:14:31,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 249 states and 362 transitions. [2023-02-15 23:14:31,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:31,446 INFO L218 hiAutomatonCegarLoop]: Abstraction has 249 states and 362 transitions. [2023-02-15 23:14:31,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 362 transitions. [2023-02-15 23:14:31,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 131. [2023-02-15 23:14:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 80 states have internal predecessors, (94), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (66), 40 states have call predecessors, (66), 42 states have call successors, (66) [2023-02-15 23:14:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 202 transitions. [2023-02-15 23:14:31,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 131 states and 202 transitions. [2023-02-15 23:14:31,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 23:14:31,479 INFO L428 stractBuchiCegarLoop]: Abstraction has 131 states and 202 transitions. [2023-02-15 23:14:31,479 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-15 23:14:31,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 202 transitions. [2023-02-15 23:14:31,481 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2023-02-15 23:14:31,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:31,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:31,483 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 23:14:31,483 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:31,483 INFO L748 eck$LassoCheckResult]: Stem: 1773#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1728#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1729#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1756#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1774#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1746#L42-3 [2023-02-15 23:14:31,483 INFO L750 eck$LassoCheckResult]: Loop: 1746#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1759#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1760#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1796#$Ultimate##0 ~n := #in~n; 1801#L25 assume !(~n <= 0); 1700#L26 call #t~ret0 := fact(~n - 1);< 1734#$Ultimate##0 ~n := #in~n; 1804#L25 assume ~n <= 0;#res := 1; 1802#factFINAL assume true; 1698#factEXIT >#66#return; 1704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1795#factFINAL assume true; 1786#factEXIT >#68#return; 1789#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1796#$Ultimate##0 ~n := #in~n; 1801#L25 assume ~n <= 0;#res := 1; 1800#factFINAL assume true; 1799#factEXIT >#70#return; 1787#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1794#$Ultimate##0 ~n := #in~n; 1798#L25 assume !(~n <= 0); 1700#L26 call #t~ret0 := fact(~n - 1);< 1734#$Ultimate##0 ~n := #in~n; 1804#L25 assume ~n <= 0;#res := 1; 1802#factFINAL assume true; 1698#factEXIT >#66#return; 1704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1795#factFINAL assume true; 1786#factEXIT >#72#return; 1793#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1784#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1782#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1781#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1753#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1745#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1746#L42-3 [2023-02-15 23:14:31,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2023-02-15 23:14:31,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:31,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354310021] [2023-02-15 23:14:31,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:31,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:31,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:31,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:31,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:31,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1403101825, now seen corresponding path program 3 times [2023-02-15 23:14:31,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:31,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255009352] [2023-02-15 23:14:31,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:31,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:31,510 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:31,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571953231] [2023-02-15 23:14:31,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 23:14:31,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:31,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:31,511 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) [2023-02-15 23:14:31,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2023-02-15 23:14:31,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-15 23:14:31,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:14:31,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 23:14:31,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-15 23:14:31,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 23:14:31,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:31,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255009352] [2023-02-15 23:14:31,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:14:31,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571953231] [2023-02-15 23:14:31,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571953231] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:14:31,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:14:31,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 23:14:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523904024] [2023-02-15 23:14:31,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:14:31,582 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:14:31,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:31,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 23:14:31,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 23:14:31,582 INFO L87 Difference]: Start difference. First operand 131 states and 202 transitions. cyclomatic complexity: 76 Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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) [2023-02-15 23:14:31,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:31,635 INFO L93 Difference]: Finished difference Result 173 states and 268 transitions. [2023-02-15 23:14:31,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 268 transitions. [2023-02-15 23:14:31,640 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2023-02-15 23:14:31,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 167 states and 262 transitions. [2023-02-15 23:14:31,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2023-02-15 23:14:31,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2023-02-15 23:14:31,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 262 transitions. [2023-02-15 23:14:31,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:31,644 INFO L218 hiAutomatonCegarLoop]: Abstraction has 167 states and 262 transitions. [2023-02-15 23:14:31,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 262 transitions. [2023-02-15 23:14:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. [2023-02-15 23:14:31,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 86 states have internal predecessors, (100), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (66), 40 states have call predecessors, (66), 42 states have call successors, (66) [2023-02-15 23:14:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 208 transitions. [2023-02-15 23:14:31,654 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 208 transitions. [2023-02-15 23:14:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 23:14:31,655 INFO L428 stractBuchiCegarLoop]: Abstraction has 137 states and 208 transitions. [2023-02-15 23:14:31,655 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-15 23:14:31,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 208 transitions. [2023-02-15 23:14:31,656 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2023-02-15 23:14:31,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:31,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:31,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 23:14:31,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:31,657 INFO L748 eck$LassoCheckResult]: Stem: 2176#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2143#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2144#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2161#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 2177#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2152#L42-3 [2023-02-15 23:14:31,658 INFO L750 eck$LassoCheckResult]: Loop: 2152#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2216#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2205#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2213#$Ultimate##0 ~n := #in~n; 2218#L25 assume !(~n <= 0); 2119#L26 call #t~ret0 := fact(~n - 1);< 2149#$Ultimate##0 ~n := #in~n; 2236#L25 assume ~n <= 0;#res := 1; 2134#factFINAL assume true; 2118#factEXIT >#66#return; 2124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2212#factFINAL assume true; 2200#factEXIT >#68#return; 2201#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2213#$Ultimate##0 ~n := #in~n; 2218#L25 assume ~n <= 0;#res := 1; 2217#factFINAL assume true; 2215#factEXIT >#70#return; 2208#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2211#$Ultimate##0 ~n := #in~n; 2214#L25 assume !(~n <= 0); 2119#L26 call #t~ret0 := fact(~n - 1);< 2149#$Ultimate##0 ~n := #in~n; 2236#L25 assume ~n <= 0;#res := 1; 2134#factFINAL assume true; 2118#factEXIT >#66#return; 2124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2212#factFINAL assume true; 2200#factEXIT >#72#return; 2210#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2245#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 2223#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2221#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2181#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2202#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2213#$Ultimate##0 ~n := #in~n; 2218#L25 assume !(~n <= 0); 2119#L26 call #t~ret0 := fact(~n - 1);< 2149#$Ultimate##0 ~n := #in~n; 2236#L25 assume ~n <= 0;#res := 1; 2134#factFINAL assume true; 2118#factEXIT >#66#return; 2124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2212#factFINAL assume true; 2200#factEXIT >#74#return; 2203#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2213#$Ultimate##0 ~n := #in~n; 2218#L25 assume ~n <= 0;#res := 1; 2217#factFINAL assume true; 2215#factEXIT >#76#return; 2206#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2211#$Ultimate##0 ~n := #in~n; 2214#L25 assume !(~n <= 0); 2119#L26 call #t~ret0 := fact(~n - 1);< 2149#$Ultimate##0 ~n := #in~n; 2236#L25 assume ~n <= 0;#res := 1; 2134#factFINAL assume true; 2118#factEXIT >#66#return; 2124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2212#factFINAL assume true; 2200#factEXIT >#78#return; 2199#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2194#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2182#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2180#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 2155#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 2151#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2152#L42-3 [2023-02-15 23:14:31,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:31,658 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2023-02-15 23:14:31,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:31,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734894980] [2023-02-15 23:14:31,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:31,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:31,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:31,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:31,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:31,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1715041092, now seen corresponding path program 1 times [2023-02-15 23:14:31,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:31,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591730985] [2023-02-15 23:14:31,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:31,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:31,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:31,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860362938] [2023-02-15 23:14:31,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:31,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:31,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:31,678 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) [2023-02-15 23:14:31,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2023-02-15 23:14:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:31,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 23:14:31,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:31,823 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 118 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-02-15 23:14:31,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 10 proven. 52 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-15 23:14:31,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:31,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591730985] [2023-02-15 23:14:31,985 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:14:31,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860362938] [2023-02-15 23:14:31,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860362938] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:31,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:14:31,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-02-15 23:14:31,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785775733] [2023-02-15 23:14:31,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:31,986 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:14:31,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:31,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 23:14:31,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-02-15 23:14:31,986 INFO L87 Difference]: Start difference. First operand 137 states and 208 transitions. cyclomatic complexity: 76 Second operand has 16 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 14 states have internal predecessors, (40), 9 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 7 states have call predecessors, (15), 9 states have call successors, (15) [2023-02-15 23:14:32,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:32,469 INFO L93 Difference]: Finished difference Result 270 states and 395 transitions. [2023-02-15 23:14:32,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 395 transitions. [2023-02-15 23:14:32,473 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 105 [2023-02-15 23:14:32,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 395 transitions. [2023-02-15 23:14:32,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2023-02-15 23:14:32,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2023-02-15 23:14:32,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 395 transitions. [2023-02-15 23:14:32,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:32,479 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 395 transitions. [2023-02-15 23:14:32,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 395 transitions. [2023-02-15 23:14:32,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 185. [2023-02-15 23:14:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 125 states have (on average 1.12) internal successors, (140), 122 states have internal predecessors, (140), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (82), 52 states have call predecessors, (82), 50 states have call successors, (82) [2023-02-15 23:14:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 272 transitions. [2023-02-15 23:14:32,496 INFO L240 hiAutomatonCegarLoop]: Abstraction has 185 states and 272 transitions. [2023-02-15 23:14:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 23:14:32,502 INFO L428 stractBuchiCegarLoop]: Abstraction has 185 states and 272 transitions. [2023-02-15 23:14:32,502 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-15 23:14:32,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 272 transitions. [2023-02-15 23:14:32,503 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2023-02-15 23:14:32,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:32,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:32,508 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 23:14:32,508 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 9, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:32,509 INFO L748 eck$LassoCheckResult]: Stem: 3031#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2992#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2993#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 3010#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 3032#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 3001#L42-3 [2023-02-15 23:14:32,510 INFO L750 eck$LassoCheckResult]: Loop: 3001#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3082#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 3059#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#68#return; 3054#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume ~n <= 0;#res := 1; 3076#factFINAL assume true; 3075#factEXIT >#70#return; 3058#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3063#$Ultimate##0 ~n := #in~n; 3070#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#72#return; 3062#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 3137#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 3133#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 3079#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3077#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 3060#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#68#return; 3053#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#70#return; 3057#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume ~n <= 0;#res := 1; 3076#factFINAL assume true; 3075#factEXIT >#72#return; 3074#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 3073#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 3071#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 3069#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3035#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 3043#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#74#return; 3055#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume ~n <= 0;#res := 1; 3076#factFINAL assume true; 3075#factEXIT >#76#return; 3056#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3063#$Ultimate##0 ~n := #in~n; 3070#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#78#return; 3047#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 3041#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 3036#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 3034#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 3007#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 3000#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 3001#L42-3 [2023-02-15 23:14:32,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:32,513 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 4 times [2023-02-15 23:14:32,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:32,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855755369] [2023-02-15 23:14:32,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:32,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:32,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:32,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:32,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:32,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1813506637, now seen corresponding path program 2 times [2023-02-15 23:14:32,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:32,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933536934] [2023-02-15 23:14:32,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:32,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:32,536 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:32,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553507274] [2023-02-15 23:14:32,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:14:32,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:32,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:32,545 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) [2023-02-15 23:14:32,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2023-02-15 23:14:32,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:14:32,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:14:32,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 23:14:32,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 230 proven. 82 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-02-15 23:14:32,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 79 proven. 134 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2023-02-15 23:14:33,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:33,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933536934] [2023-02-15 23:14:33,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:14:33,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553507274] [2023-02-15 23:14:33,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553507274] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:33,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:14:33,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 18 [2023-02-15 23:14:33,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474135147] [2023-02-15 23:14:33,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:33,070 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:14:33,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:33,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 23:14:33,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-02-15 23:14:33,071 INFO L87 Difference]: Start difference. First operand 185 states and 272 transitions. cyclomatic complexity: 92 Second operand has 18 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 16 states have internal predecessors, (45), 11 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) [2023-02-15 23:14:33,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:33,618 INFO L93 Difference]: Finished difference Result 337 states and 498 transitions. [2023-02-15 23:14:33,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 498 transitions. [2023-02-15 23:14:33,622 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 86 [2023-02-15 23:14:33,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 337 states and 498 transitions. [2023-02-15 23:14:33,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2023-02-15 23:14:33,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2023-02-15 23:14:33,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 337 states and 498 transitions. [2023-02-15 23:14:33,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:33,627 INFO L218 hiAutomatonCegarLoop]: Abstraction has 337 states and 498 transitions. [2023-02-15 23:14:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states and 498 transitions. [2023-02-15 23:14:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 211. [2023-02-15 23:14:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 145 states have (on average 1.1172413793103448) internal successors, (162), 144 states have internal predecessors, (162), 50 states have call successors, (50), 10 states have call predecessors, (50), 16 states have return successors, (104), 56 states have call predecessors, (104), 50 states have call successors, (104) [2023-02-15 23:14:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 316 transitions. [2023-02-15 23:14:33,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 211 states and 316 transitions. [2023-02-15 23:14:33,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 23:14:33,639 INFO L428 stractBuchiCegarLoop]: Abstraction has 211 states and 316 transitions. [2023-02-15 23:14:33,639 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-15 23:14:33,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 316 transitions. [2023-02-15 23:14:33,640 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2023-02-15 23:14:33,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:33,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:33,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 23:14:33,642 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 9, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:33,642 INFO L748 eck$LassoCheckResult]: Stem: 4185#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4145#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 4168#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 4186#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4159#L42-3 [2023-02-15 23:14:33,642 INFO L750 eck$LassoCheckResult]: Loop: 4159#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4214#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 4201#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#68#return; 4193#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume ~n <= 0;#res := 1; 4210#factFINAL assume true; 4207#factEXIT >#70#return; 4194#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4206#$Ultimate##0 ~n := #in~n; 4220#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#72#return; 4204#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 4231#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 4230#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4229#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4228#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 4203#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4206#$Ultimate##0 ~n := #in~n; 4220#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#68#return; 4196#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#70#return; 4195#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume ~n <= 0;#res := 1; 4210#factFINAL assume true; 4207#factEXIT >#72#return; 4208#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 4237#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 4234#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4233#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4188#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 4200#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4206#$Ultimate##0 ~n := #in~n; 4220#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume !(~n <= 0); 4218#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4219#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4221#factFINAL assume true; 4217#factEXIT >#66#return; 4216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4215#factFINAL assume true; 4211#factEXIT >#74#return; 4202#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#76#return; 4199#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4206#$Ultimate##0 ~n := #in~n; 4220#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#78#return; 4191#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 4190#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 4189#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4187#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 4166#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 4158#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4159#L42-3 [2023-02-15 23:14:33,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:33,642 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 5 times [2023-02-15 23:14:33,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:33,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509475234] [2023-02-15 23:14:33,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:33,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:33,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:33,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash 590406435, now seen corresponding path program 3 times [2023-02-15 23:14:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:33,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674895072] [2023-02-15 23:14:33,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:33,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:33,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:33,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [338011568] [2023-02-15 23:14:33,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 23:14:33,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:33,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:33,664 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) [2023-02-15 23:14:33,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2023-02-15 23:14:33,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-15 23:14:33,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:14:33,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:33,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:33,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:33,821 INFO L85 PathProgramCache]: Analyzing trace with hash -552239216, now seen corresponding path program 1 times [2023-02-15 23:14:33,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:33,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318841600] [2023-02-15 23:14:33,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:33,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:33,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:33,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606082429] [2023-02-15 23:14:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:33,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:33,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:33,838 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:33,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2023-02-15 23:14:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:33,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:14:33,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 143 proven. 1 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2023-02-15 23:14:33,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2023-02-15 23:14:34,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:34,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318841600] [2023-02-15 23:14:34,042 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:14:34,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606082429] [2023-02-15 23:14:34,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606082429] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:34,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:14:34,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-02-15 23:14:34,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852962149] [2023-02-15 23:14:34,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:36,442 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:36,443 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:36,443 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:36,444 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:36,445 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:36,445 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:36,445 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:36,445 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:36,445 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2023-02-15 23:14:36,446 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:36,446 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:36,449 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,454 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,475 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,477 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,479 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,480 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,481 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,483 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,485 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,697 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:36,698 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:36,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:36,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:36,703 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) [2023-02-15 23:14:36,703 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 [2023-02-15 23:14:36,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:36,705 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:36,712 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:36,712 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:36,715 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 [2023-02-15 23:14:36,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:36,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:36,716 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) [2023-02-15 23:14:36,717 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 [2023-02-15 23:14:36,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:36,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:36,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2023-02-15 23:14:36,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:36,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:36,731 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) [2023-02-15 23:14:36,732 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 [2023-02-15 23:14:36,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:36,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:37,035 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:37,040 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 [2023-02-15 23:14:37,040 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:37,041 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:37,041 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:37,041 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:37,041 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:37,041 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,041 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:37,041 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:37,041 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2023-02-15 23:14:37,041 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:37,041 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:37,042 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,044 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,045 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,047 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,065 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,066 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,068 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,071 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,072 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,234 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:37,235 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:37,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,236 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) [2023-02-15 23:14:37,237 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 [2023-02-15 23:14:37,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:37,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:37,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:37,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:37,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:37,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:37,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:37,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:37,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:37,253 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 [2023-02-15 23:14:37,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,255 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) [2023-02-15 23:14:37,256 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 [2023-02-15 23:14:37,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:37,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:37,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:37,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:37,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:37,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:37,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:37,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:37,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:37,268 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 [2023-02-15 23:14:37,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,269 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) [2023-02-15 23:14:37,270 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 [2023-02-15 23:14:37,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:37,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:37,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:37,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:37,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:37,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:37,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:37,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:37,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:37,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2023-02-15 23:14:37,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,284 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) [2023-02-15 23:14:37,286 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 [2023-02-15 23:14:37,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:37,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:37,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:37,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:37,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:37,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:37,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:37,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:37,298 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:37,302 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-15 23:14:37,302 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:14:37,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,305 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) [2023-02-15 23:14:37,305 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 [2023-02-15 23:14:37,306 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:37,306 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:37,306 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:37,306 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 3 Supporting invariants [] [2023-02-15 23:14:37,309 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 [2023-02-15 23:14:37,310 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:37,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:37,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 23:14:37,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:37,371 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 [2023-02-15 23:14:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:37,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 23:14:37,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 5 proven. 107 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2023-02-15 23:14:37,728 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2023-02-15 23:14:37,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 211 states and 316 transitions. cyclomatic complexity: 110 Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 23:14:38,003 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 211 states and 316 transitions. cyclomatic complexity: 110. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Result 607 states and 918 transitions. Complement of second has 32 states. [2023-02-15 23:14:38,003 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 [2023-02-15 23:14:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 4 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 23:14:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2023-02-15 23:14:38,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 84 transitions. Stem has 5 letters. Loop has 111 letters. [2023-02-15 23:14:38,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:38,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 84 transitions. Stem has 116 letters. Loop has 111 letters. [2023-02-15 23:14:38,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:38,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 84 transitions. Stem has 5 letters. Loop has 222 letters. [2023-02-15 23:14:38,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:38,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 607 states and 918 transitions. [2023-02-15 23:14:38,017 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 77 [2023-02-15 23:14:38,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 607 states to 410 states and 616 transitions. [2023-02-15 23:14:38,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2023-02-15 23:14:38,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2023-02-15 23:14:38,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 410 states and 616 transitions. [2023-02-15 23:14:38,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:38,023 INFO L218 hiAutomatonCegarLoop]: Abstraction has 410 states and 616 transitions. [2023-02-15 23:14:38,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states and 616 transitions. [2023-02-15 23:14:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 394. [2023-02-15 23:14:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 268 states have (on average 1.1194029850746268) internal successors, (300), 265 states have internal predecessors, (300), 96 states have call successors, (96), 19 states have call predecessors, (96), 30 states have return successors, (196), 109 states have call predecessors, (196), 96 states have call successors, (196) [2023-02-15 23:14:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 592 transitions. [2023-02-15 23:14:38,037 INFO L240 hiAutomatonCegarLoop]: Abstraction has 394 states and 592 transitions. [2023-02-15 23:14:38,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:38,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 23:14:38,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 23:14:38,038 INFO L87 Difference]: Start difference. First operand 394 states and 592 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2023-02-15 23:14:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:38,168 INFO L93 Difference]: Finished difference Result 448 states and 677 transitions. [2023-02-15 23:14:38,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 448 states and 677 transitions. [2023-02-15 23:14:38,173 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 83 [2023-02-15 23:14:38,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 448 states to 439 states and 663 transitions. [2023-02-15 23:14:38,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2023-02-15 23:14:38,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2023-02-15 23:14:38,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 439 states and 663 transitions. [2023-02-15 23:14:38,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:38,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 439 states and 663 transitions. [2023-02-15 23:14:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states and 663 transitions. [2023-02-15 23:14:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2023-02-15 23:14:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 296 states have (on average 1.114864864864865) internal successors, (330), 295 states have internal predecessors, (330), 111 states have call successors, (111), 19 states have call predecessors, (111), 30 states have return successors, (220), 122 states have call predecessors, (220), 110 states have call successors, (220) [2023-02-15 23:14:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 661 transitions. [2023-02-15 23:14:38,194 INFO L240 hiAutomatonCegarLoop]: Abstraction has 437 states and 661 transitions. [2023-02-15 23:14:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 23:14:38,195 INFO L428 stractBuchiCegarLoop]: Abstraction has 437 states and 661 transitions. [2023-02-15 23:14:38,195 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-15 23:14:38,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 437 states and 661 transitions. [2023-02-15 23:14:38,198 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 83 [2023-02-15 23:14:38,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:38,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:38,198 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:38,198 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 23:14:38,198 INFO L748 eck$LassoCheckResult]: Stem: 7001#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 6933#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6934#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 6975#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 6964#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 6965#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7039#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 7013#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7025#$Ultimate##0 ~n := #in~n; 7028#L25 assume !(~n <= 0); 7029#L26 call #t~ret0 := fact(~n - 1);< 6945#$Ultimate##0 [2023-02-15 23:14:38,198 INFO L750 eck$LassoCheckResult]: Loop: 6945#$Ultimate##0 ~n := #in~n; 7059#L25 assume !(~n <= 0); 7043#L26 call #t~ret0 := fact(~n - 1);< 6945#$Ultimate##0 [2023-02-15 23:14:38,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash 271623377, now seen corresponding path program 1 times [2023-02-15 23:14:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:38,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261138462] [2023-02-15 23:14:38,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:38,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:38,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261138462] [2023-02-15 23:14:38,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261138462] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:14:38,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:14:38,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 23:14:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525312368] [2023-02-15 23:14:38,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:14:38,238 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:14:38,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:38,238 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 1 times [2023-02-15 23:14:38,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:38,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402272578] [2023-02-15 23:14:38,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:38,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:38,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:38,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:38,263 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:38,264 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:38,264 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:38,264 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:38,264 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:38,264 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:38,264 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:38,264 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:38,264 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2023-02-15 23:14:38,264 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:38,264 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:38,265 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:38,266 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:38,270 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:38,272 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:38,290 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:38,290 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:38,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:38,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:38,293 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) [2023-02-15 23:14:38,313 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 [2023-02-15 23:14:38,313 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:38,314 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:38,343 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:38,343 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:38,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:38,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:38,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:38,347 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) [2023-02-15 23:14:38,349 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 [2023-02-15 23:14:38,350 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:38,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:38,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:38,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:38,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:38,361 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:38,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2023-02-15 23:14:38,364 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:38,364 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:38,412 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:38,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2023-02-15 23:14:38,416 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:38,416 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:38,416 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:38,416 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:38,416 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:38,416 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:38,416 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:38,417 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:38,417 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2023-02-15 23:14:38,417 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:38,417 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:38,418 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:38,420 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:38,423 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:38,425 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:38,451 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:38,451 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:38,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:38,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:38,453 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:38,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2023-02-15 23:14:38,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:38,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:38,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:38,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:38,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:38,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:38,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:38,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:38,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:38,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2023-02-15 23:14:38,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:38,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:38,467 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:38,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2023-02-15 23:14:38,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:38,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:38,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:38,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:38,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:38,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:38,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:38,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:38,479 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:38,481 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-15 23:14:38,481 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 23:14:38,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:38,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:38,482 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:38,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2023-02-15 23:14:38,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:38,485 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:38,485 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:38,485 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2023-02-15 23:14:38,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2023-02-15 23:14:38,489 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:38,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:38,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:14:38,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:38,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 23:14:38,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:38,564 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 [2023-02-15 23:14:38,565 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 437 states and 661 transitions. cyclomatic complexity: 234 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) [2023-02-15 23:14:38,612 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 437 states and 661 transitions. cyclomatic complexity: 234. 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 498 states and 738 transitions. Complement of second has 13 states. [2023-02-15 23:14:38,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:38,614 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) [2023-02-15 23:14:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2023-02-15 23:14:38,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 11 letters. Loop has 3 letters. [2023-02-15 23:14:38,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:38,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-15 23:14:38,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:38,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-15 23:14:38,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:38,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 738 transitions. [2023-02-15 23:14:38,621 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 83 [2023-02-15 23:14:38,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 483 states and 716 transitions. [2023-02-15 23:14:38,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2023-02-15 23:14:38,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2023-02-15 23:14:38,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 716 transitions. [2023-02-15 23:14:38,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:38,627 INFO L218 hiAutomatonCegarLoop]: Abstraction has 483 states and 716 transitions. [2023-02-15 23:14:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 716 transitions. [2023-02-15 23:14:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 479. [2023-02-15 23:14:38,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 326 states have (on average 1.1196319018404908) internal successors, (365), 327 states have internal predecessors, (365), 115 states have call successors, (115), 29 states have call predecessors, (115), 38 states have return successors, (228), 122 states have call predecessors, (228), 114 states have call successors, (228) [2023-02-15 23:14:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 708 transitions. [2023-02-15 23:14:38,642 INFO L240 hiAutomatonCegarLoop]: Abstraction has 479 states and 708 transitions. [2023-02-15 23:14:38,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:38,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 23:14:38,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 23:14:38,643 INFO L87 Difference]: Start difference. First operand 479 states and 708 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) [2023-02-15 23:14:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:38,702 INFO L93 Difference]: Finished difference Result 482 states and 710 transitions. [2023-02-15 23:14:38,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 710 transitions. [2023-02-15 23:14:38,707 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 83 [2023-02-15 23:14:38,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 474 states and 700 transitions. [2023-02-15 23:14:38,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2023-02-15 23:14:38,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2023-02-15 23:14:38,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 474 states and 700 transitions. [2023-02-15 23:14:38,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:38,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 474 states and 700 transitions. [2023-02-15 23:14:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states and 700 transitions. [2023-02-15 23:14:38,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 473. [2023-02-15 23:14:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 321 states have (on average 1.118380062305296) internal successors, (359), 322 states have internal predecessors, (359), 114 states have call successors, (114), 29 states have call predecessors, (114), 38 states have return successors, (226), 121 states have call predecessors, (226), 114 states have call successors, (226) [2023-02-15 23:14:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 699 transitions. [2023-02-15 23:14:38,728 INFO L240 hiAutomatonCegarLoop]: Abstraction has 473 states and 699 transitions. [2023-02-15 23:14:38,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 23:14:38,729 INFO L428 stractBuchiCegarLoop]: Abstraction has 473 states and 699 transitions. [2023-02-15 23:14:38,729 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-15 23:14:38,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 473 states and 699 transitions. [2023-02-15 23:14:38,732 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 83 [2023-02-15 23:14:38,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:38,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:38,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:38,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:38,738 INFO L748 eck$LassoCheckResult]: Stem: 8958#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 8876#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8877#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 8902#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 8889#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 8890#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9046#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 9036#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9037#$Ultimate##0 ~n := #in~n; 9043#L25 assume ~n <= 0;#res := 1; 9041#factFINAL assume true; 9035#factEXIT >#68#return; 8883#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9030#$Ultimate##0 ~n := #in~n; 9031#L25 assume ~n <= 0;#res := 1; 9047#factFINAL assume true; 9038#factEXIT >#70#return; 8882#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 9030#$Ultimate##0 ~n := #in~n; 9031#L25 assume ~n <= 0;#res := 1; 9047#factFINAL assume true; 9038#factEXIT >#72#return; 9039#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 9045#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 9044#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 9042#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9040#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 8884#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9034#$Ultimate##0 ~n := #in~n; 9027#L25 assume !(~n <= 0); 8862#L26 call #t~ret0 := fact(~n - 1);< 8885#$Ultimate##0 ~n := #in~n; 8943#L25 assume ~n <= 0;#res := 1; 8874#factFINAL assume true; 8861#factEXIT >#66#return; 8863#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8921#factFINAL assume true; 9058#factEXIT >#74#return; 8913#L30-6 [2023-02-15 23:14:38,739 INFO L750 eck$LassoCheckResult]: Loop: 8913#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 8945#$Ultimate##0 ~n := #in~n; 9088#L25 assume !(~n <= 0); 9002#L26 call #t~ret0 := fact(~n - 1);< 9006#$Ultimate##0 ~n := #in~n; 9012#L25 assume ~n <= 0;#res := 1; 9010#factFINAL assume true; 9000#factEXIT >#66#return; 8863#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8921#factFINAL assume true; 9058#factEXIT >#76#return; 8920#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 8858#$Ultimate##0 ~n := #in~n; 8947#L25 assume !(~n <= 0); 9002#L26 call #t~ret0 := fact(~n - 1);< 9006#$Ultimate##0 ~n := #in~n; 9012#L25 assume ~n <= 0;#res := 1; 9010#factFINAL assume true; 9000#factEXIT >#66#return; 8863#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8921#factFINAL assume true; 9058#factEXIT >#78#return; 9060#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 9102#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 9093#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 9091#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 8905#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 8906#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 8858#$Ultimate##0 ~n := #in~n; 8947#L25 assume !(~n <= 0); 9002#L26 call #t~ret0 := fact(~n - 1);< 9006#$Ultimate##0 ~n := #in~n; 9012#L25 assume !(~n <= 0); 9001#L26 call #t~ret0 := fact(~n - 1);< 9006#$Ultimate##0 ~n := #in~n; 9012#L25 assume !(~n <= 0); 9001#L26 call #t~ret0 := fact(~n - 1);< 9006#$Ultimate##0 ~n := #in~n; 9012#L25 assume ~n <= 0;#res := 1; 9010#factFINAL assume true; 9000#factEXIT >#66#return; 9004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9017#factFINAL assume true; 9013#factEXIT >#66#return; 9004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9017#factFINAL assume true; 9013#factEXIT >#66#return; 9015#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9065#factFINAL assume true; 9066#factEXIT >#74#return; 8913#L30-6 [2023-02-15 23:14:38,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:38,739 INFO L85 PathProgramCache]: Analyzing trace with hash -426322681, now seen corresponding path program 1 times [2023-02-15 23:14:38,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:38,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737931022] [2023-02-15 23:14:38,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:38,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:38,752 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:38,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2019543794] [2023-02-15 23:14:38,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:38,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:38,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:38,757 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) [2023-02-15 23:14:38,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2023-02-15 23:14:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:38,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:38,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1167330940, now seen corresponding path program 1 times [2023-02-15 23:14:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:38,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126082020] [2023-02-15 23:14:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:38,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:38,821 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:38,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [902352288] [2023-02-15 23:14:38,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:38,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:38,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:38,833 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) [2023-02-15 23:14:38,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2023-02-15 23:14:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:38,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:38,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:38,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1873696258, now seen corresponding path program 1 times [2023-02-15 23:14:38,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:38,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878167352] [2023-02-15 23:14:38,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:38,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:38,905 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:38,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1037599025] [2023-02-15 23:14:38,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:38,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:38,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:38,909 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:38,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2023-02-15 23:14:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:38,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:14:38,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 209 proven. 1 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-02-15 23:14:39,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 25 proven. 27 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2023-02-15 23:14:39,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:39,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878167352] [2023-02-15 23:14:39,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:14:39,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037599025] [2023-02-15 23:14:39,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037599025] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:39,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:14:39,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-02-15 23:14:39,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314786376] [2023-02-15 23:14:39,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:39,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2023-02-15 23:14:39,732 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:39,732 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:39,732 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:39,732 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:39,732 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:39,732 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:39,733 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:39,733 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:39,733 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2023-02-15 23:14:39,733 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:39,733 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:39,734 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:39,736 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:39,769 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:39,771 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:39,772 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:39,775 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:39,878 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:39,878 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:39,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:39,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:39,881 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) [2023-02-15 23:14:39,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:39,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:39,896 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 [2023-02-15 23:14:39,897 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:39,897 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:39,900 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 [2023-02-15 23:14:39,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:39,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:39,901 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) [2023-02-15 23:14:39,903 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 [2023-02-15 23:14:39,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:39,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:39,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:39,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:39,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:39,917 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) [2023-02-15 23:14:39,919 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 [2023-02-15 23:14:39,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:39,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:39,934 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:39,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:39,937 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:39,937 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:39,937 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:39,937 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:39,937 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:39,937 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:39,937 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:39,937 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:39,937 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2023-02-15 23:14:39,937 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:39,938 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:39,938 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:39,940 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:39,964 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:39,966 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:39,967 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:39,969 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:40,049 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:40,050 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:40,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:40,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:40,051 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) [2023-02-15 23:14:40,052 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 [2023-02-15 23:14:40,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:40,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:40,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:40,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:40,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:40,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:40,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:40,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:40,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:40,063 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 [2023-02-15 23:14:40,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:40,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:40,064 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) [2023-02-15 23:14:40,066 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 [2023-02-15 23:14:40,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:40,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:40,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:40,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:40,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:40,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:40,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:40,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:40,079 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:40,084 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-15 23:14:40,084 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:14:40,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:40,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:40,089 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:40,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2023-02-15 23:14:40,090 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:40,090 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:40,090 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:40,090 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 5 Supporting invariants [] [2023-02-15 23:14:40,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:40,093 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:40,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:40,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 23:14:40,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:40,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-15 23:14:40,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-02-15 23:14:40,545 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2023-02-15 23:14:40,545 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 473 states and 699 transitions. cyclomatic complexity: 238 Second operand has 12 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-15 23:14:40,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:40,842 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 473 states and 699 transitions. cyclomatic complexity: 238. Second operand has 12 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) Result 802 states and 1121 transitions. Complement of second has 57 states. [2023-02-15 23:14:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-15 23:14:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2023-02-15 23:14:40,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 80 transitions. Stem has 38 letters. Loop has 50 letters. [2023-02-15 23:14:40,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:40,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 80 transitions. Stem has 88 letters. Loop has 50 letters. [2023-02-15 23:14:40,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:40,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 80 transitions. Stem has 38 letters. Loop has 100 letters. [2023-02-15 23:14:40,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:40,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 802 states and 1121 transitions. [2023-02-15 23:14:40,853 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 86 [2023-02-15 23:14:40,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 802 states to 800 states and 1119 transitions. [2023-02-15 23:14:40,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 265 [2023-02-15 23:14:40,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 266 [2023-02-15 23:14:40,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 800 states and 1119 transitions. [2023-02-15 23:14:40,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:40,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 800 states and 1119 transitions. [2023-02-15 23:14:40,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states and 1119 transitions. [2023-02-15 23:14:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 670. [2023-02-15 23:14:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 447 states have (on average 1.1118568232662192) internal successors, (497), 452 states have internal predecessors, (497), 143 states have call successors, (146), 49 states have call predecessors, (146), 80 states have return successors, (316), 168 states have call predecessors, (316), 143 states have call successors, (316) [2023-02-15 23:14:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 959 transitions. [2023-02-15 23:14:40,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 670 states and 959 transitions. [2023-02-15 23:14:40,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:40,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 23:14:40,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 23:14:40,887 INFO L87 Difference]: Start difference. First operand 670 states and 959 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-15 23:14:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:40,994 INFO L93 Difference]: Finished difference Result 686 states and 963 transitions. [2023-02-15 23:14:40,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 686 states and 963 transitions. [2023-02-15 23:14:41,001 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 86 [2023-02-15 23:14:41,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 686 states to 671 states and 933 transitions. [2023-02-15 23:14:41,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 233 [2023-02-15 23:14:41,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 233 [2023-02-15 23:14:41,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 671 states and 933 transitions. [2023-02-15 23:14:41,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:41,008 INFO L218 hiAutomatonCegarLoop]: Abstraction has 671 states and 933 transitions. [2023-02-15 23:14:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states and 933 transitions. [2023-02-15 23:14:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 663. [2023-02-15 23:14:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 443 states have (on average 1.1060948081264108) internal successors, (490), 449 states have internal predecessors, (490), 140 states have call successors, (143), 49 states have call predecessors, (143), 80 states have return successors, (290), 164 states have call predecessors, (290), 139 states have call successors, (290) [2023-02-15 23:14:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 923 transitions. [2023-02-15 23:14:41,029 INFO L240 hiAutomatonCegarLoop]: Abstraction has 663 states and 923 transitions. [2023-02-15 23:14:41,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 23:14:41,030 INFO L428 stractBuchiCegarLoop]: Abstraction has 663 states and 923 transitions. [2023-02-15 23:14:41,030 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-15 23:14:41,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 663 states and 923 transitions. [2023-02-15 23:14:41,034 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 86 [2023-02-15 23:14:41,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:41,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:41,034 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:41,034 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 23:14:41,035 INFO L748 eck$LassoCheckResult]: Stem: 12456#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 12406#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12407#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 12431#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 12418#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 12419#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 12987#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 12985#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 12986#$Ultimate##0 ~n := #in~n; 12989#L25 assume ~n <= 0;#res := 1; 12988#factFINAL assume true; 12984#factEXIT >#68#return; 12413#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 12981#$Ultimate##0 ~n := #in~n; 12983#L25 assume ~n <= 0;#res := 1; 12982#factFINAL assume true; 12980#factEXIT >#70#return; 12414#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 12981#$Ultimate##0 ~n := #in~n; 12983#L25 assume ~n <= 0;#res := 1; 12982#factFINAL assume true; 12980#factEXIT >#72#return; 12979#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 12978#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 12977#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 12976#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 12971#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 12415#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 12857#$Ultimate##0 ~n := #in~n; 12950#L25 assume !(~n <= 0); 12412#L26 call #t~ret0 := fact(~n - 1);< 12416#$Ultimate##0 ~n := #in~n; 12972#L25 assume ~n <= 0;#res := 1; 12990#factFINAL assume true; 12963#factEXIT >#66#return; 12961#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 12959#factFINAL assume true; 12856#factEXIT >#74#return; 12451#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 12453#$Ultimate##0 ~n := #in~n; 12835#L25 assume !(~n <= 0); 12836#L26 call #t~ret0 := fact(~n - 1);< 12895#$Ultimate##0 [2023-02-15 23:14:41,035 INFO L750 eck$LassoCheckResult]: Loop: 12895#$Ultimate##0 ~n := #in~n; 12911#L25 assume !(~n <= 0); 12891#L26 call #t~ret0 := fact(~n - 1);< 12895#$Ultimate##0 [2023-02-15 23:14:41,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:41,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1705579033, now seen corresponding path program 1 times [2023-02-15 23:14:41,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:41,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010538209] [2023-02-15 23:14:41,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:41,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:41,041 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:41,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401078327] [2023-02-15 23:14:41,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:41,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:41,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,043 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) [2023-02-15 23:14:41,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2023-02-15 23:14:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:41,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:14:41,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-15 23:14:41,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 23:14:41,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:41,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010538209] [2023-02-15 23:14:41,129 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:14:41,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401078327] [2023-02-15 23:14:41,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401078327] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:14:41,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:14:41,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 23:14:41,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112573850] [2023-02-15 23:14:41,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:14:41,130 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:14:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:41,130 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 2 times [2023-02-15 23:14:41,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:41,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644894519] [2023-02-15 23:14:41,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:41,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:41,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:41,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:41,158 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:41,158 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:41,158 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:41,158 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:41,158 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:41,158 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,158 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:41,158 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:41,158 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2023-02-15 23:14:41,158 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:41,158 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:41,159 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,160 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,162 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,165 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,181 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:41,181 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:41,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,182 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) [2023-02-15 23:14:41,184 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 [2023-02-15 23:14:41,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:41,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:41,192 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:41,192 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:41,195 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 [2023-02-15 23:14:41,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,196 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) [2023-02-15 23:14:41,197 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 [2023-02-15 23:14:41,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:41,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:41,205 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:41,205 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:41,208 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 [2023-02-15 23:14:41,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,209 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) [2023-02-15 23:14:41,211 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 [2023-02-15 23:14:41,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:41,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:41,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:41,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,223 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) [2023-02-15 23:14:41,225 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 [2023-02-15 23:14:41,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:41,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:41,264 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:41,267 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 [2023-02-15 23:14:41,267 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:41,267 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:41,267 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:41,267 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:41,267 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:41,267 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,268 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:41,268 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:41,268 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2023-02-15 23:14:41,268 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:41,268 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:41,268 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,270 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,282 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,286 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,303 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:41,303 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:41,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,304 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) [2023-02-15 23:14:41,309 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 [2023-02-15 23:14:41,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:41,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:41,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:41,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:41,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:41,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:41,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:41,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:41,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:41,329 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 [2023-02-15 23:14:41,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,331 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) [2023-02-15 23:14:41,332 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 [2023-02-15 23:14:41,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:41,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:41,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:41,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:41,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:41,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:41,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:41,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:41,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:41,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2023-02-15 23:14:41,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,344 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) [2023-02-15 23:14:41,348 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 [2023-02-15 23:14:41,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:41,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:41,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:41,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:41,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:41,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:41,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:41,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:41,357 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:41,359 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-15 23:14:41,359 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 23:14:41,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,360 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:41,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2023-02-15 23:14:41,363 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:41,363 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:41,363 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:41,363 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2023-02-15 23:14:41,366 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 [2023-02-15 23:14:41,366 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:41,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:41,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 23:14:41,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:41,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:41,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 23:14:41,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:41,642 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 [2023-02-15 23:14:41,642 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 663 states and 923 transitions. cyclomatic complexity: 278 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 23:14:41,712 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 663 states and 923 transitions. cyclomatic complexity: 278. 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 687 states and 951 transitions. Complement of second has 13 states. [2023-02-15 23:14:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:41,713 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 23:14:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2023-02-15 23:14:41,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 42 letters. Loop has 3 letters. [2023-02-15 23:14:41,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:41,714 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:14:41,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:41,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 23:14:41,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:41,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 23:14:41,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:41,961 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 [2023-02-15 23:14:41,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 663 states and 923 transitions. cyclomatic complexity: 278 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 23:14:42,024 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 663 states and 923 transitions. cyclomatic complexity: 278. 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 687 states and 951 transitions. Complement of second has 13 states. [2023-02-15 23:14:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:42,025 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 23:14:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2023-02-15 23:14:42,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 42 letters. Loop has 3 letters. [2023-02-15 23:14:42,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:42,026 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:14:42,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:42,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 23:14:42,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:42,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 23:14:42,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:42,248 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 [2023-02-15 23:14:42,248 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 663 states and 923 transitions. cyclomatic complexity: 278 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 23:14:42,332 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 663 states and 923 transitions. cyclomatic complexity: 278. 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 805 states and 1091 transitions. Complement of second has 16 states. [2023-02-15 23:14:42,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:42,333 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 23:14:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2023-02-15 23:14:42,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 42 letters. Loop has 3 letters. [2023-02-15 23:14:42,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:42,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 45 letters. Loop has 3 letters. [2023-02-15 23:14:42,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:42,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 42 letters. Loop has 6 letters. [2023-02-15 23:14:42,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:42,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 805 states and 1091 transitions. [2023-02-15 23:14:42,351 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 80 [2023-02-15 23:14:42,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 805 states to 715 states and 1000 transitions. [2023-02-15 23:14:42,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 227 [2023-02-15 23:14:42,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 233 [2023-02-15 23:14:42,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 715 states and 1000 transitions. [2023-02-15 23:14:42,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:42,359 INFO L218 hiAutomatonCegarLoop]: Abstraction has 715 states and 1000 transitions. [2023-02-15 23:14:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states and 1000 transitions. [2023-02-15 23:14:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 697. [2023-02-15 23:14:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 471 states have (on average 1.1125265392781316) internal successors, (524), 476 states have internal predecessors, (524), 139 states have call successors, (142), 56 states have call predecessors, (142), 87 states have return successors, (290), 164 states have call predecessors, (290), 139 states have call successors, (290) [2023-02-15 23:14:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 956 transitions. [2023-02-15 23:14:42,382 INFO L240 hiAutomatonCegarLoop]: Abstraction has 697 states and 956 transitions. [2023-02-15 23:14:42,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:42,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 23:14:42,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 23:14:42,383 INFO L87 Difference]: Start difference. First operand 697 states and 956 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 23:14:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:42,451 INFO L93 Difference]: Finished difference Result 713 states and 968 transitions. [2023-02-15 23:14:42,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 713 states and 968 transitions. [2023-02-15 23:14:42,457 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 80 [2023-02-15 23:14:42,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 713 states to 713 states and 968 transitions. [2023-02-15 23:14:42,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2023-02-15 23:14:42,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2023-02-15 23:14:42,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 713 states and 968 transitions. [2023-02-15 23:14:42,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:42,463 INFO L218 hiAutomatonCegarLoop]: Abstraction has 713 states and 968 transitions. [2023-02-15 23:14:42,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states and 968 transitions. [2023-02-15 23:14:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 705. [2023-02-15 23:14:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 477 states have (on average 1.1027253668763102) internal successors, (526), 482 states have internal predecessors, (526), 139 states have call successors, (142), 58 states have call predecessors, (142), 89 states have return successors, (290), 164 states have call predecessors, (290), 139 states have call successors, (290) [2023-02-15 23:14:42,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 958 transitions. [2023-02-15 23:14:42,485 INFO L240 hiAutomatonCegarLoop]: Abstraction has 705 states and 958 transitions. [2023-02-15 23:14:42,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 23:14:42,486 INFO L428 stractBuchiCegarLoop]: Abstraction has 705 states and 958 transitions. [2023-02-15 23:14:42,486 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-02-15 23:14:42,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 705 states and 958 transitions. [2023-02-15 23:14:42,490 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 80 [2023-02-15 23:14:42,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:42,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:42,491 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:42,492 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, 1] [2023-02-15 23:14:42,492 INFO L748 eck$LassoCheckResult]: Stem: 17326#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 17274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17275#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 17297#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 17284#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 17285#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 17632#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 17258#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17259#$Ultimate##0 ~n := #in~n; 17622#L25 assume ~n <= 0;#res := 1; 17620#factFINAL assume true; 17616#factEXIT >#68#return; 17317#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 17318#$Ultimate##0 ~n := #in~n; 17626#L25 assume ~n <= 0;#res := 1; 17625#factFINAL assume true; 17624#factEXIT >#70#return; 17255#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 17256#$Ultimate##0 ~n := #in~n; 17685#L25 assume ~n <= 0;#res := 1; 17757#factFINAL assume true; 17751#factEXIT >#72#return; 17291#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 17292#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 17306#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 17311#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 17303#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 17304#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17672#$Ultimate##0 ~n := #in~n; 17683#L25 assume !(~n <= 0); 17680#L26 call #t~ret0 := fact(~n - 1);< 17681#$Ultimate##0 ~n := #in~n; 17715#L25 assume ~n <= 0;#res := 1; 17686#factFINAL assume true; 17679#factEXIT >#66#return; 17678#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17677#factFINAL assume true; 17669#factEXIT >#74#return; 17667#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 17736#$Ultimate##0 ~n := #in~n; 17682#L25 assume ~n <= 0;#res := 1; 17674#factFINAL assume true; 17675#factEXIT >#76#return; 17437#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 17438#$Ultimate##0 ~n := #in~n; 17763#L25 assume !(~n <= 0); 17754#L26 call #t~ret0 := fact(~n - 1);< 17756#$Ultimate##0 ~n := #in~n; 17769#L25 assume ~n <= 0;#res := 1; 17778#factFINAL assume true; 17753#factEXIT >#66#return; 17747#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17746#factFINAL assume true; 17745#factEXIT >#78#return; 17436#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 17658#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 17657#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 17406#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 17295#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 17296#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 17392#L42-3 [2023-02-15 23:14:42,492 INFO L750 eck$LassoCheckResult]: Loop: 17392#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 17361#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 17338#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17352#$Ultimate##0 ~n := #in~n; 17356#L25 assume !(~n <= 0); 17357#L26 call #t~ret0 := fact(~n - 1);< 17371#$Ultimate##0 ~n := #in~n; 17387#L25 assume !(~n <= 0); 17379#L26 call #t~ret0 := fact(~n - 1);< 17385#$Ultimate##0 ~n := #in~n; 17389#L25 assume ~n <= 0;#res := 1; 17391#factFINAL assume true; 17390#factEXIT >#66#return; 17380#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17384#factFINAL assume true; 17378#factEXIT >#66#return; 17376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17353#factFINAL assume true; 17354#factEXIT >#68#return; 17339#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 17352#$Ultimate##0 ~n := #in~n; 17356#L25 assume ~n <= 0;#res := 1; 17355#factFINAL assume true; 17350#factEXIT >#70#return; 17336#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 17349#$Ultimate##0 ~n := #in~n; 17373#L25 assume !(~n <= 0); 17357#L26 call #t~ret0 := fact(~n - 1);< 17371#$Ultimate##0 ~n := #in~n; 17388#L25 assume ~n <= 0;#res := 1; 17375#factFINAL assume true; 17366#factEXIT >#66#return; 17364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17362#factFINAL assume true; 17334#factEXIT >#72#return; 17346#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 17374#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 17372#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 17365#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 17363#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 17345#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17349#$Ultimate##0 ~n := #in~n; 17373#L25 assume !(~n <= 0); 17357#L26 call #t~ret0 := fact(~n - 1);< 17371#$Ultimate##0 ~n := #in~n; 17387#L25 assume !(~n <= 0); 17379#L26 call #t~ret0 := fact(~n - 1);< 17385#$Ultimate##0 ~n := #in~n; 17389#L25 assume ~n <= 0;#res := 1; 17391#factFINAL assume true; 17390#factEXIT >#66#return; 17380#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17384#factFINAL assume true; 17378#factEXIT >#66#return; 17376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17353#factFINAL assume true; 17354#factEXIT >#68#return; 17341#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 17352#$Ultimate##0 ~n := #in~n; 17356#L25 assume !(~n <= 0); 17357#L26 call #t~ret0 := fact(~n - 1);< 17371#$Ultimate##0 ~n := #in~n; 17388#L25 assume ~n <= 0;#res := 1; 17375#factFINAL assume true; 17366#factEXIT >#66#return; 17364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17362#factFINAL assume true; 17334#factEXIT >#70#return; 17342#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 17352#$Ultimate##0 ~n := #in~n; 17356#L25 assume ~n <= 0;#res := 1; 17355#factFINAL assume true; 17350#factEXIT >#72#return; 17351#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 17360#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 17359#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 17358#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 17330#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 17343#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17349#$Ultimate##0 ~n := #in~n; 17373#L25 assume !(~n <= 0); 17357#L26 call #t~ret0 := fact(~n - 1);< 17371#$Ultimate##0 ~n := #in~n; 17387#L25 assume !(~n <= 0); 17379#L26 call #t~ret0 := fact(~n - 1);< 17385#$Ultimate##0 ~n := #in~n; 17389#L25 assume ~n <= 0;#res := 1; 17391#factFINAL assume true; 17390#factEXIT >#66#return; 17380#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17384#factFINAL assume true; 17378#factEXIT >#66#return; 17376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17353#factFINAL assume true; 17354#factEXIT >#74#return; 17340#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 17352#$Ultimate##0 ~n := #in~n; 17356#L25 assume ~n <= 0;#res := 1; 17355#factFINAL assume true; 17350#factEXIT >#76#return; 17335#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 17349#$Ultimate##0 ~n := #in~n; 17373#L25 assume !(~n <= 0); 17357#L26 call #t~ret0 := fact(~n - 1);< 17371#$Ultimate##0 ~n := #in~n; 17388#L25 assume ~n <= 0;#res := 1; 17375#factFINAL assume true; 17366#factEXIT >#66#return; 17364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17362#factFINAL assume true; 17334#factEXIT >#78#return; 17333#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 17332#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 17331#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 17329#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 17293#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 17294#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 17392#L42-3 [2023-02-15 23:14:42,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:42,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 2 times [2023-02-15 23:14:42,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:42,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532809409] [2023-02-15 23:14:42,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:42,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:42,499 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:42,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960562455] [2023-02-15 23:14:42,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:14:42,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:42,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:42,501 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) [2023-02-15 23:14:42,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2023-02-15 23:14:42,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:14:42,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:14:42,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:42,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash 386087323, now seen corresponding path program 4 times [2023-02-15 23:14:42,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:42,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013976640] [2023-02-15 23:14:42,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:42,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:42,594 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:42,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [854589861] [2023-02-15 23:14:42,595 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 23:14:42,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:42,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:42,596 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) [2023-02-15 23:14:42,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2023-02-15 23:14:42,662 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 23:14:42,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:14:42,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 23:14:42,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 348 proven. 29 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2023-02-15 23:14:42,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 24 proven. 248 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2023-02-15 23:14:43,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:43,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013976640] [2023-02-15 23:14:43,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:14:43,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854589861] [2023-02-15 23:14:43,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854589861] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:43,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:14:43,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2023-02-15 23:14:43,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660251129] [2023-02-15 23:14:43,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:43,062 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:14:43,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:43,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 23:14:43,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-02-15 23:14:43,062 INFO L87 Difference]: Start difference. First operand 705 states and 958 transitions. cyclomatic complexity: 271 Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 10 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (24), 8 states have call predecessors, (24), 10 states have call successors, (24) [2023-02-15 23:14:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:43,382 INFO L93 Difference]: Finished difference Result 1212 states and 1617 transitions. [2023-02-15 23:14:43,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1212 states and 1617 transitions. [2023-02-15 23:14:43,391 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 151 [2023-02-15 23:14:43,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1212 states to 1193 states and 1594 transitions. [2023-02-15 23:14:43,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 412 [2023-02-15 23:14:43,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 412 [2023-02-15 23:14:43,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1193 states and 1594 transitions. [2023-02-15 23:14:43,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:43,400 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1193 states and 1594 transitions. [2023-02-15 23:14:43,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states and 1594 transitions. [2023-02-15 23:14:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 798. [2023-02-15 23:14:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 524 states have (on average 1.0935114503816794) internal successors, (573), 522 states have internal predecessors, (573), 181 states have call successors, (186), 81 states have call predecessors, (186), 93 states have return successors, (354), 194 states have call predecessors, (354), 181 states have call successors, (354) [2023-02-15 23:14:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1113 transitions. [2023-02-15 23:14:43,427 INFO L240 hiAutomatonCegarLoop]: Abstraction has 798 states and 1113 transitions. [2023-02-15 23:14:43,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 23:14:43,428 INFO L428 stractBuchiCegarLoop]: Abstraction has 798 states and 1113 transitions. [2023-02-15 23:14:43,428 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-02-15 23:14:43,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 798 states and 1113 transitions. [2023-02-15 23:14:43,433 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 83 [2023-02-15 23:14:43,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:43,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:43,435 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 6, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:43,435 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:43,436 INFO L748 eck$LassoCheckResult]: Stem: 19968#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 19909#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 19910#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 19932#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 19969#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 20115#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 19935#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 19899#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 19900#$Ultimate##0 ~n := #in~n; 20116#L25 assume ~n <= 0;#res := 1; 20114#factFINAL assume true; 20111#factEXIT >#68#return; 19955#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 19956#$Ultimate##0 ~n := #in~n; 19959#L25 assume ~n <= 0;#res := 1; 20260#factFINAL assume true; 20257#factEXIT >#70#return; 19895#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 19896#$Ultimate##0 ~n := #in~n; 20205#L25 assume ~n <= 0;#res := 1; 20204#factFINAL assume true; 20203#factEXIT >#72#return; 20202#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 20201#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 20200#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 20199#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 20108#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 20109#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 20197#$Ultimate##0 ~n := #in~n; 20217#L25 assume !(~n <= 0); 20128#L26 call #t~ret0 := fact(~n - 1);< 20129#$Ultimate##0 ~n := #in~n; 20233#L25 assume !(~n <= 0); 20230#L26 call #t~ret0 := fact(~n - 1);< 20231#$Ultimate##0 ~n := #in~n; 20235#L25 assume ~n <= 0;#res := 1; 20245#factFINAL assume true; 20244#factEXIT >#66#return; 20239#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20240#factFINAL assume true; 20242#factEXIT >#66#return; 20243#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20206#factFINAL assume true; 20207#factEXIT >#74#return; 20138#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 20141#$Ultimate##0 ~n := #in~n; 20261#L25 assume ~n <= 0;#res := 1; 20258#factFINAL assume true; 20136#factEXIT >#76#return; 19916#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 20178#$Ultimate##0 ~n := #in~n; 20179#L25 assume !(~n <= 0); 19915#L26 call #t~ret0 := fact(~n - 1);< 19917#$Ultimate##0 ~n := #in~n; 20218#L25 assume !(~n <= 0); 20211#L26 call #t~ret0 := fact(~n - 1);< 20216#$Ultimate##0 ~n := #in~n; 20228#L25 assume ~n <= 0;#res := 1; 20227#factFINAL assume true; 20226#factEXIT >#66#return; 20225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20224#factFINAL assume true; 20223#factEXIT >#66#return; 20212#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20267#factFINAL assume true; 20266#factEXIT >#78#return; 19891#L30-8 [2023-02-15 23:14:43,437 INFO L750 eck$LassoCheckResult]: Loop: 19891#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 20265#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 20262#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 20255#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 20198#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 19885#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 19886#$Ultimate##0 ~n := #in~n; 20134#L25 assume !(~n <= 0); 20210#L26 call #t~ret0 := fact(~n - 1);< 20214#$Ultimate##0 ~n := #in~n; 20218#L25 assume !(~n <= 0); 20211#L26 call #t~ret0 := fact(~n - 1);< 20216#$Ultimate##0 ~n := #in~n; 20218#L25 assume !(~n <= 0); 20211#L26 call #t~ret0 := fact(~n - 1);< 20216#$Ultimate##0 ~n := #in~n; 20218#L25 assume !(~n <= 0); 20211#L26 call #t~ret0 := fact(~n - 1);< 20216#$Ultimate##0 ~n := #in~n; 20228#L25 assume ~n <= 0;#res := 1; 20227#factFINAL assume true; 20226#factEXIT >#66#return; 20225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20224#factFINAL assume true; 20223#factEXIT >#66#return; 20222#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20221#factFINAL assume true; 20219#factEXIT >#66#return; 20213#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20215#factFINAL assume true; 20209#factEXIT >#66#return; 20208#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20120#factFINAL assume true; 20110#factEXIT >#74#return; 19949#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 19964#$Ultimate##0 ~n := #in~n; 19948#L25 assume ~n <= 0;#res := 1; 19950#factFINAL assume true; 20259#factEXIT >#76#return; 19904#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 20121#$Ultimate##0 ~n := #in~n; 20131#L25 assume !(~n <= 0); 20132#L26 call #t~ret0 := fact(~n - 1);< 19917#$Ultimate##0 ~n := #in~n; 20218#L25 assume !(~n <= 0); 20211#L26 call #t~ret0 := fact(~n - 1);< 20216#$Ultimate##0 ~n := #in~n; 20228#L25 assume ~n <= 0;#res := 1; 20227#factFINAL assume true; 20226#factEXIT >#66#return; 20225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20224#factFINAL assume true; 20223#factEXIT >#66#return; 20220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19903#factFINAL assume true; 19905#factEXIT >#78#return; 19891#L30-8 [2023-02-15 23:14:43,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:43,437 INFO L85 PathProgramCache]: Analyzing trace with hash -341163101, now seen corresponding path program 1 times [2023-02-15 23:14:43,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:43,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242367441] [2023-02-15 23:14:43,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:43,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:43,463 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:43,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1139742952] [2023-02-15 23:14:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:43,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:43,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,469 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) [2023-02-15 23:14:43,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2023-02-15 23:14:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:43,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 23:14:43,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 129 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-15 23:14:43,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 25 proven. 38 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2023-02-15 23:14:43,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:43,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242367441] [2023-02-15 23:14:43,735 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:14:43,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139742952] [2023-02-15 23:14:43,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139742952] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:43,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:14:43,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2023-02-15 23:14:43,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238089001] [2023-02-15 23:14:43,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:43,736 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:14:43,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:43,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1158367668, now seen corresponding path program 2 times [2023-02-15 23:14:43,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:43,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995555199] [2023-02-15 23:14:43,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:43,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:43,740 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:43,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1502056564] [2023-02-15 23:14:43,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:14:43,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:43,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,744 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) [2023-02-15 23:14:43,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2023-02-15 23:14:43,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:14:43,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:14:43,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 23:14:43,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 38 proven. 82 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-02-15 23:14:43,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 37 proven. 95 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-15 23:14:44,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:44,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995555199] [2023-02-15 23:14:44,528 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:14:44,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502056564] [2023-02-15 23:14:44,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502056564] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:44,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:14:44,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 21 [2023-02-15 23:14:44,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81526879] [2023-02-15 23:14:44,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:44,529 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:14:44,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:44,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 23:14:44,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-02-15 23:14:44,530 INFO L87 Difference]: Start difference. First operand 798 states and 1113 transitions. cyclomatic complexity: 333 Second operand has 22 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 13 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 11 states have call predecessors, (17), 13 states have call successors, (17) [2023-02-15 23:14:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:45,357 INFO L93 Difference]: Finished difference Result 2039 states and 3264 transitions. [2023-02-15 23:14:45,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2039 states and 3264 transitions. [2023-02-15 23:14:45,375 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 364 [2023-02-15 23:14:45,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2039 states to 2022 states and 3247 transitions. [2023-02-15 23:14:45,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 678 [2023-02-15 23:14:45,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 678 [2023-02-15 23:14:45,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2022 states and 3247 transitions. [2023-02-15 23:14:45,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:45,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2022 states and 3247 transitions. [2023-02-15 23:14:45,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states and 3247 transitions. [2023-02-15 23:14:45,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1119. [2023-02-15 23:14:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 680 states have (on average 1.0720588235294117) internal successors, (729), 674 states have internal predecessors, (729), 308 states have call successors, (318), 123 states have call predecessors, (318), 131 states have return successors, (920), 321 states have call predecessors, (920), 308 states have call successors, (920) [2023-02-15 23:14:45,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1967 transitions. [2023-02-15 23:14:45,451 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1119 states and 1967 transitions. [2023-02-15 23:14:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 23:14:45,452 INFO L428 stractBuchiCegarLoop]: Abstraction has 1119 states and 1967 transitions. [2023-02-15 23:14:45,452 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-02-15 23:14:45,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1119 states and 1967 transitions. [2023-02-15 23:14:45,459 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 111 [2023-02-15 23:14:45,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:45,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:45,460 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 6, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:45,461 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:45,461 INFO L748 eck$LassoCheckResult]: Stem: 23597#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 23542#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 23543#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 23562#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 23598#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 23780#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 23761#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 23535#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 23536#$Ultimate##0 ~n := #in~n; 23783#L25 assume ~n <= 0;#res := 1; 23781#factFINAL assume true; 23779#factEXIT >#68#return; 23586#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 23587#$Ultimate##0 ~n := #in~n; 23811#L25 assume ~n <= 0;#res := 1; 23810#factFINAL assume true; 23809#factEXIT >#70#return; 23532#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 23533#$Ultimate##0 ~n := #in~n; 23866#L25 assume ~n <= 0;#res := 1; 23865#factFINAL assume true; 23864#factEXIT >#72#return; 23863#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 23862#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 23861#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 23860#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 23848#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 23503#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 23504#$Ultimate##0 ~n := #in~n; 23876#L25 assume !(~n <= 0); 23547#L26 call #t~ret0 := fact(~n - 1);< 23548#$Ultimate##0 ~n := #in~n; 23945#L25 assume !(~n <= 0); 23907#L26 call #t~ret0 := fact(~n - 1);< 23943#$Ultimate##0 ~n := #in~n; 23949#L25 assume ~n <= 0;#res := 1; 23953#factFINAL assume true; 23952#factEXIT >#66#return; 23951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23950#factFINAL assume true; 23946#factEXIT >#66#return; 23947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23959#factFINAL assume true; 23960#factEXIT >#74#return; 23593#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 23595#$Ultimate##0 ~n := #in~n; 23844#L25 assume ~n <= 0;#res := 1; 23840#factFINAL assume true; 23830#factEXIT >#76#return; 23590#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 23589#$Ultimate##0 ~n := #in~n; 23591#L25 assume !(~n <= 0); 23854#L26 call #t~ret0 := fact(~n - 1);< 23891#$Ultimate##0 ~n := #in~n; 23902#L25 assume !(~n <= 0); 23850#L26 call #t~ret0 := fact(~n - 1);< 23898#$Ultimate##0 ~n := #in~n; 23900#L25 assume ~n <= 0;#res := 1; 23899#factFINAL assume true; 23897#factEXIT >#66#return; 23895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23890#factFINAL assume true; 23884#factEXIT >#66#return; 23885#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24001#factFINAL assume true; 23997#factEXIT >#78#return; 23509#L30-8 [2023-02-15 23:14:45,461 INFO L750 eck$LassoCheckResult]: Loop: 23509#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 23995#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 23993#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 23826#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 23600#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 23601#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 23842#$Ultimate##0 ~n := #in~n; 23875#L25 assume !(~n <= 0); 23579#L26 call #t~ret0 := fact(~n - 1);< 23859#$Ultimate##0 ~n := #in~n; 23902#L25 assume !(~n <= 0); 23850#L26 call #t~ret0 := fact(~n - 1);< 23898#$Ultimate##0 ~n := #in~n; 23902#L25 assume !(~n <= 0); 23850#L26 call #t~ret0 := fact(~n - 1);< 23898#$Ultimate##0 ~n := #in~n; 23902#L25 assume !(~n <= 0); 23850#L26 call #t~ret0 := fact(~n - 1);< 23898#$Ultimate##0 ~n := #in~n; 23900#L25 assume ~n <= 0;#res := 1; 23899#factFINAL assume true; 23897#factEXIT >#66#return; 23895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23890#factFINAL assume true; 23884#factEXIT >#66#return; 23883#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23881#factFINAL assume true; 23879#factEXIT >#66#return; 23858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23868#factFINAL assume true; 23849#factEXIT >#66#return; 23847#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23845#factFINAL assume true; 23841#factEXIT >#74#return; 23828#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 23838#$Ultimate##0 ~n := #in~n; 23843#L25 assume ~n <= 0;#res := 1; 23839#factFINAL assume true; 23827#factEXIT >#76#return; 23829#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 23846#$Ultimate##0 ~n := #in~n; 23867#L25 assume !(~n <= 0); 23855#L26 call #t~ret0 := fact(~n - 1);< 23869#$Ultimate##0 ~n := #in~n; 23892#L25 assume !(~n <= 0); 23856#L26 call #t~ret0 := fact(~n - 1);< 23870#$Ultimate##0 ~n := #in~n; 23904#L25 assume !(~n <= 0); 23851#L26 call #t~ret0 := fact(~n - 1);< 23886#$Ultimate##0 ~n := #in~n; 23902#L25 assume !(~n <= 0); 23850#L26 call #t~ret0 := fact(~n - 1);< 23898#$Ultimate##0 ~n := #in~n; 23900#L25 assume ~n <= 0;#res := 1; 23899#factFINAL assume true; 23897#factEXIT >#66#return; 23895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23890#factFINAL assume true; 23884#factEXIT >#66#return; 23883#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23881#factFINAL assume true; 23879#factEXIT >#66#return; 23858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23868#factFINAL assume true; 23849#factEXIT >#66#return; 23847#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23845#factFINAL assume true; 23841#factEXIT >#78#return; 23509#L30-8 [2023-02-15 23:14:45,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:45,462 INFO L85 PathProgramCache]: Analyzing trace with hash -341163101, now seen corresponding path program 2 times [2023-02-15 23:14:45,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:45,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466595072] [2023-02-15 23:14:45,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:45,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:45,470 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:45,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [780587959] [2023-02-15 23:14:45,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:14:45,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:45,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:45,474 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) [2023-02-15 23:14:45,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2023-02-15 23:14:45,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:14:45,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:14:45,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 23:14:45,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 129 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-15 23:14:45,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 25 proven. 38 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2023-02-15 23:14:45,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:45,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466595072] [2023-02-15 23:14:45,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:14:45,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780587959] [2023-02-15 23:14:45,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780587959] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:45,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:14:45,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2023-02-15 23:14:45,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740022695] [2023-02-15 23:14:45,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:45,733 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:14:45,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:45,734 INFO L85 PathProgramCache]: Analyzing trace with hash 857296756, now seen corresponding path program 3 times [2023-02-15 23:14:45,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:45,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756182119] [2023-02-15 23:14:45,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:45,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:45,738 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:45,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1663181181] [2023-02-15 23:14:45,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 23:14:45,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:45,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:45,742 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) [2023-02-15 23:14:45,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2023-02-15 23:14:45,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2023-02-15 23:14:45,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:14:45,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:45,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:47,097 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:47,098 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:47,098 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:47,098 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:47,098 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:47,098 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:47,098 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:47,098 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:47,098 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2023-02-15 23:14:47,098 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:47,098 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:47,099 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:47,101 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:47,103 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:47,132 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:47,134 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:47,238 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:47,238 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:47,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:47,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:47,245 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:47,249 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:47,249 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:47,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2023-02-15 23:14:47,277 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:47,277 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:47,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:47,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:47,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:47,282 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:47,289 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:47,289 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:47,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2023-02-15 23:14:47,313 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:47,313 INFO L440 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: [] [2023-02-15 23:14:47,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:47,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:47,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:47,321 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:47,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:47,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:47,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2023-02-15 23:14:47,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:47,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:47,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:47,352 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:47,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2023-02-15 23:14:47,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:47,355 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:47,385 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:47,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:47,391 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:47,391 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:47,391 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:47,391 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:47,391 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:47,391 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:47,391 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:47,391 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:47,391 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2023-02-15 23:14:47,391 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:47,391 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:47,393 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:47,395 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:47,396 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:47,424 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:47,426 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:47,540 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:47,540 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:47,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:47,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:47,542 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:47,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2023-02-15 23:14:47,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:47,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:47,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:47,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:47,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:47,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:47,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:47,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:47,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:47,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:47,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:47,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:47,572 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:47,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 [2023-02-15 23:14:47,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:47,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:47,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:47,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:47,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:47,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:47,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:47,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2023-02-15 23:14:47,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:47,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:47,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:47,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:47,618 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:47,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2023-02-15 23:14:47,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:47,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:47,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:47,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:47,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:47,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:47,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:47,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:47,646 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:47,653 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:14:47,654 INFO L444 ModelExtractionUtils]: 8 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 23:14:47,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:47,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:47,657 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:47,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2023-02-15 23:14:47,659 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:47,659 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:47,659 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:47,660 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2023-02-15 23:14:47,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:47,663 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:47,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:47,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 23:14:47,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:48,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:48,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 23:14:48,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-02-15 23:14:48,357 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 [2023-02-15 23:14:48,357 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1119 states and 1967 transitions. cyclomatic complexity: 866 Second operand has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 6 states have call successors, (15) [2023-02-15 23:14:48,663 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1119 states and 1967 transitions. cyclomatic complexity: 866. Second operand has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 6 states have call successors, (15) Result 1842 states and 2962 transitions. Complement of second has 53 states. [2023-02-15 23:14:48,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 6 states have call successors, (15) [2023-02-15 23:14:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 79 transitions. [2023-02-15 23:14:48,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 79 transitions. Stem has 66 letters. Loop has 68 letters. [2023-02-15 23:14:48,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:48,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 79 transitions. Stem has 134 letters. Loop has 68 letters. [2023-02-15 23:14:48,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:48,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 79 transitions. Stem has 66 letters. Loop has 136 letters. [2023-02-15 23:14:48,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:48,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1842 states and 2962 transitions. [2023-02-15 23:14:48,688 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 111 [2023-02-15 23:14:48,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1842 states to 1616 states and 2660 transitions. [2023-02-15 23:14:48,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 436 [2023-02-15 23:14:48,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 438 [2023-02-15 23:14:48,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1616 states and 2660 transitions. [2023-02-15 23:14:48,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:48,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1616 states and 2660 transitions. [2023-02-15 23:14:48,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states and 2660 transitions. [2023-02-15 23:14:48,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1513. [2023-02-15 23:14:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 934 states have (on average 1.0610278372591007) internal successors, (991), 924 states have internal predecessors, (991), 378 states have call successors, (396), 185 states have call predecessors, (396), 201 states have return successors, (1114), 403 states have call predecessors, (1114), 378 states have call successors, (1114) [2023-02-15 23:14:48,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2501 transitions. [2023-02-15 23:14:48,754 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1513 states and 2501 transitions. [2023-02-15 23:14:48,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:48,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 23:14:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-15 23:14:48,754 INFO L87 Difference]: Start difference. First operand 1513 states and 2501 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 7 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2023-02-15 23:14:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:48,959 INFO L93 Difference]: Finished difference Result 1579 states and 2691 transitions. [2023-02-15 23:14:48,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1579 states and 2691 transitions. [2023-02-15 23:14:48,973 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2023-02-15 23:14:48,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1579 states to 1531 states and 2639 transitions. [2023-02-15 23:14:48,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2023-02-15 23:14:48,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2023-02-15 23:14:48,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1531 states and 2639 transitions. [2023-02-15 23:14:48,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:48,991 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1531 states and 2639 transitions. [2023-02-15 23:14:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states and 2639 transitions. [2023-02-15 23:14:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1321. [2023-02-15 23:14:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 816 states have (on average 1.0649509803921569) internal successors, (869), 810 states have internal predecessors, (869), 338 states have call successors, (350), 157 states have call predecessors, (350), 167 states have return successors, (980), 353 states have call predecessors, (980), 338 states have call successors, (980) [2023-02-15 23:14:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 2199 transitions. [2023-02-15 23:14:49,042 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1321 states and 2199 transitions. [2023-02-15 23:14:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 23:14:49,043 INFO L428 stractBuchiCegarLoop]: Abstraction has 1321 states and 2199 transitions. [2023-02-15 23:14:49,043 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-02-15 23:14:49,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1321 states and 2199 transitions. [2023-02-15 23:14:49,052 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 111 [2023-02-15 23:14:49,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:49,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:49,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:49,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 10, 10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:49,054 INFO L748 eck$LassoCheckResult]: Stem: 30534#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 30479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 30480#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 30502#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 30489#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 30490#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30781#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 30470#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30471#$Ultimate##0 ~n := #in~n; 30776#L25 assume ~n <= 0;#res := 1; 30775#factFINAL assume true; 30774#factEXIT >#68#return; 30518#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 30519#$Ultimate##0 ~n := #in~n; 30785#L25 assume ~n <= 0;#res := 1; 30784#factFINAL assume true; 30783#factEXIT >#70#return; 30466#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30467#$Ultimate##0 ~n := #in~n; 30885#L25 assume ~n <= 0;#res := 1; 30883#factFINAL assume true; 30879#factEXIT >#72#return; 30878#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 30876#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 30874#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 30873#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30505#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 30506#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30796#$Ultimate##0 ~n := #in~n; 30823#L25 assume !(~n <= 0); 30820#L26 call #t~ret0 := fact(~n - 1);< 30821#$Ultimate##0 ~n := #in~n; 30826#L25 assume ~n <= 0;#res := 1; 30822#factFINAL assume true; 30819#factEXIT >#66#return; 30813#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30790#factFINAL assume true; 30791#factEXIT >#74#return; 30527#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 30529#$Ultimate##0 ~n := #in~n; 30987#L25 assume ~n <= 0;#res := 1; 30985#factFINAL assume true; 30984#factEXIT >#76#return; 30485#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30535#$Ultimate##0 ~n := #in~n; 31008#L25 assume !(~n <= 0); 30474#L26 call #t~ret0 := fact(~n - 1);< 30486#$Ultimate##0 ~n := #in~n; 30514#L25 assume ~n <= 0;#res := 1; 30515#factFINAL assume true; 31264#factEXIT >#66#return; 31255#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31251#factFINAL assume true; 31006#factEXIT >#78#return; 30990#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 30991#binomialCoefficient_returnLabel#2 [2023-02-15 23:14:49,054 INFO L750 eck$LassoCheckResult]: Loop: 30991#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 30531#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 30532#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30818#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 30456#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30457#$Ultimate##0 ~n := #in~n; 30829#L25 assume !(~n <= 0); 30805#L26 call #t~ret0 := fact(~n - 1);< 30812#$Ultimate##0 ~n := #in~n; 30886#L25 assume !(~n <= 0); 30801#L26 call #t~ret0 := fact(~n - 1);< 30851#$Ultimate##0 ~n := #in~n; 30886#L25 assume !(~n <= 0); 30801#L26 call #t~ret0 := fact(~n - 1);< 30851#$Ultimate##0 ~n := #in~n; 30886#L25 assume !(~n <= 0); 30801#L26 call #t~ret0 := fact(~n - 1);< 30851#$Ultimate##0 ~n := #in~n; 30886#L25 assume !(~n <= 0); 30801#L26 call #t~ret0 := fact(~n - 1);< 30851#$Ultimate##0 ~n := #in~n; 30945#L25 assume ~n <= 0;#res := 1; 30871#factFINAL assume true; 30850#factEXIT >#66#return; 30844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30841#factFINAL assume true; 30837#factEXIT >#66#return; 30835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30832#factFINAL assume true; 30831#factEXIT >#66#return; 30828#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30827#factFINAL assume true; 30824#factEXIT >#66#return; 30809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30814#factFINAL assume true; 30800#factEXIT >#66#return; 30799#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30798#factFINAL assume true; 30786#factEXIT >#74#return; 30788#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 30794#$Ultimate##0 ~n := #in~n; 30797#L25 assume ~n <= 0;#res := 1; 30795#factFINAL assume true; 30793#factEXIT >#76#return; 30787#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30792#$Ultimate##0 ~n := #in~n; 30830#L25 assume !(~n <= 0); 30806#L26 call #t~ret0 := fact(~n - 1);< 30817#$Ultimate##0 ~n := #in~n; 31014#L25 assume !(~n <= 0); 30803#L26 call #t~ret0 := fact(~n - 1);< 30815#$Ultimate##0 ~n := #in~n; 30870#L25 assume !(~n <= 0); 30807#L26 call #t~ret0 := fact(~n - 1);< 30839#$Ultimate##0 ~n := #in~n; 30886#L25 assume !(~n <= 0); 30801#L26 call #t~ret0 := fact(~n - 1);< 30851#$Ultimate##0 ~n := #in~n; 30886#L25 assume !(~n <= 0); 30801#L26 call #t~ret0 := fact(~n - 1);< 30851#$Ultimate##0 ~n := #in~n; 30945#L25 assume ~n <= 0;#res := 1; 30871#factFINAL assume true; 30850#factEXIT >#66#return; 30844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30841#factFINAL assume true; 30837#factEXIT >#66#return; 30835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30832#factFINAL assume true; 30831#factEXIT >#66#return; 30828#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30827#factFINAL assume true; 30824#factEXIT >#66#return; 30809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30814#factFINAL assume true; 30800#factEXIT >#66#return; 30799#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30798#factFINAL assume true; 30786#factEXIT >#78#return; 30789#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 30991#binomialCoefficient_returnLabel#2 [2023-02-15 23:14:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash 970322272, now seen corresponding path program 1 times [2023-02-15 23:14:49,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:49,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218584568] [2023-02-15 23:14:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:49,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:49,063 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:49,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620460793] [2023-02-15 23:14:49,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:49,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:49,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:49,066 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) [2023-02-15 23:14:49,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2023-02-15 23:14:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:49,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:49,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:49,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1988608930, now seen corresponding path program 4 times [2023-02-15 23:14:49,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:49,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36503204] [2023-02-15 23:14:49,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:49,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:49,219 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:49,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2142660646] [2023-02-15 23:14:49,220 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 23:14:49,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:49,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:49,233 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) [2023-02-15 23:14:49,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2023-02-15 23:14:49,348 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 23:14:49,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:14:49,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:49,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:49,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:49,393 INFO L85 PathProgramCache]: Analyzing trace with hash -666167363, now seen corresponding path program 2 times [2023-02-15 23:14:49,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:49,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070066340] [2023-02-15 23:14:49,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:49,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:49,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:14:49,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2115646321] [2023-02-15 23:14:49,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:14:49,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:49,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:49,404 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:49,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2023-02-15 23:14:49,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:14:49,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:14:49,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 23:14:49,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 582 proven. 25 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2023-02-15 23:14:49,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 120 proven. 122 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-15 23:14:49,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:49,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070066340] [2023-02-15 23:14:49,904 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:14:49,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115646321] [2023-02-15 23:14:49,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115646321] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:49,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:14:49,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2023-02-15 23:14:49,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055130503] [2023-02-15 23:14:49,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:15:27,978 WARN L233 SmtUtils]: Spent 37.15s on a formula simplification. DAG size of input: 87 DAG size of output: 82 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-02-15 23:15:33,549 WARN L233 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-15 23:15:41,926 WARN L233 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-15 23:16:03,104 WARN L233 SmtUtils]: Spent 13.88s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-02-15 23:16:03,110 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:16:03,110 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:16:03,110 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:16:03,110 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:16:03,110 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:16:03,110 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:16:03,111 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:16:03,111 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:16:03,111 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2023-02-15 23:16:03,111 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:16:03,111 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:16:03,112 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:03,989 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:03,991 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:03,992 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:03,994 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:03,995 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:23,855 WARN L233 SmtUtils]: Spent 19.86s on a formula simplification. DAG size of input: 85 DAG size of output: 77 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2023-02-15 23:16:24,071 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:16:24,072 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:16:24,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:16:24,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:16:24,077 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) [2023-02-15 23:16:24,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:16:24,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:16:24,096 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 [2023-02-15 23:16:24,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:24,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:16:24,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:16:24,119 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) [2023-02-15 23:16:24,125 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:16:24,125 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:16:24,142 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 [2023-02-15 23:16:24,152 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:16:24,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:24,157 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:16:24,157 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:16:24,157 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:16:24,157 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:16:24,157 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:16:24,157 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:16:24,157 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:16:24,157 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:16:24,157 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2023-02-15 23:16:24,157 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:16:24,157 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:16:24,158 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:24,160 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:25,005 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:25,006 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:25,008 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:25,009 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:17:12,082 WARN L233 SmtUtils]: Spent 47.07s on a formula simplification. DAG size of input: 85 DAG size of output: 77 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2023-02-15 23:17:12,359 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:17:12,360 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:17:12,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:17:12,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:12,363 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) [2023-02-15 23:17:12,363 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 [2023-02-15 23:17:12,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:17:12,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:17:12,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:17:12,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:17:12,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:17:12,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:17:12,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:17:12,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:17:12,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:17:12,378 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 [2023-02-15 23:17:12,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:17:12,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:12,379 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) [2023-02-15 23:17:12,381 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 [2023-02-15 23:17:12,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:17:12,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:17:12,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:17:12,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:17:12,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:17:12,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:17:12,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:17:12,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:17:12,394 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:17:12,397 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:17:12,397 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 23:17:12,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:17:12,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:12,398 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:17:12,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2023-02-15 23:17:12,401 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:17:12,401 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:17:12,401 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:17:12,401 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 9 Supporting invariants [] [2023-02-15 23:17:12,404 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 [2023-02-15 23:17:12,405 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:17:12,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:17:12,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 23:17:12,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:17:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:17:12,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 23:17:12,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:17:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-02-15 23:17:13,051 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 [2023-02-15 23:17:13,052 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1321 states and 2199 transitions. cyclomatic complexity: 902 Second operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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) [2023-02-15 23:17:13,377 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1321 states and 2199 transitions. cyclomatic complexity: 902. Second operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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 2451 states and 3800 transitions. Complement of second has 59 states. [2023-02-15 23:17:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2023-02-15 23:17:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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) [2023-02-15 23:17:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 86 transitions. [2023-02-15 23:17:13,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 86 transitions. Stem has 55 letters. Loop has 80 letters. [2023-02-15 23:17:13,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:17:13,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 86 transitions. Stem has 135 letters. Loop has 80 letters. [2023-02-15 23:17:13,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:17:13,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 86 transitions. Stem has 55 letters. Loop has 160 letters. [2023-02-15 23:17:13,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:17:13,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2451 states and 3800 transitions. [2023-02-15 23:17:13,420 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 111 [2023-02-15 23:17:13,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2023-02-15 23:17:13,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2451 states to 1947 states and 3090 transitions. [2023-02-15 23:17:13,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 413 [2023-02-15 23:17:13,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416 [2023-02-15 23:17:13,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1947 states and 3090 transitions. [2023-02-15 23:17:13,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:17:13,443 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1947 states and 3090 transitions. [2023-02-15 23:17:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states and 3090 transitions. [2023-02-15 23:17:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1616. [2023-02-15 23:17:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1010 states have (on average 1.0574257425742575) internal successors, (1068), 1003 states have internal predecessors, (1068), 382 states have call successors, (404), 198 states have call predecessors, (404), 224 states have return successors, (1162), 414 states have call predecessors, (1162), 382 states have call successors, (1162) [2023-02-15 23:17:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2634 transitions. [2023-02-15 23:17:13,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1616 states and 2634 transitions. [2023-02-15 23:17:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:17:13,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 23:17:13,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-02-15 23:17:13,501 INFO L87 Difference]: Start difference. First operand 1616 states and 2634 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 9 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2023-02-15 23:17:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:17:13,867 INFO L93 Difference]: Finished difference Result 2064 states and 3681 transitions. [2023-02-15 23:17:13,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2064 states and 3681 transitions. [2023-02-15 23:17:13,885 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 155 [2023-02-15 23:17:13,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2064 states to 1968 states and 3573 transitions. [2023-02-15 23:17:13,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 490 [2023-02-15 23:17:13,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 490 [2023-02-15 23:17:13,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1968 states and 3573 transitions. [2023-02-15 23:17:13,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:17:13,911 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1968 states and 3573 transitions. [2023-02-15 23:17:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states and 3573 transitions. [2023-02-15 23:17:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1619. [2023-02-15 23:17:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1002 states have (on average 1.0598802395209581) internal successors, (1062), 994 states have internal predecessors, (1062), 411 states have call successors, (430), 183 states have call predecessors, (430), 206 states have return successors, (1298), 441 states have call predecessors, (1298), 411 states have call successors, (1298) [2023-02-15 23:17:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2790 transitions. [2023-02-15 23:17:13,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1619 states and 2790 transitions. [2023-02-15 23:17:13,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 23:17:13,971 INFO L428 stractBuchiCegarLoop]: Abstraction has 1619 states and 2790 transitions. [2023-02-15 23:17:13,971 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-02-15 23:17:13,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1619 states and 2790 transitions. [2023-02-15 23:17:13,979 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 121 [2023-02-15 23:17:13,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:17:13,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:17:13,981 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:13,982 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [31, 31, 22, 22, 22, 22, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:13,982 INFO L748 eck$LassoCheckResult]: Stem: 39323#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 39267#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 39268#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 39291#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 39278#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 39280#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 40340#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 39259#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 39260#$Ultimate##0 ~n := #in~n; 40388#L25 assume ~n <= 0;#res := 1; 40387#factFINAL assume true; 40380#factEXIT >#68#return; 39314#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 39315#$Ultimate##0 ~n := #in~n; 40441#L25 assume ~n <= 0;#res := 1; 40438#factFINAL assume true; 40437#factEXIT >#70#return; 39255#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 39256#$Ultimate##0 ~n := #in~n; 40475#L25 assume ~n <= 0;#res := 1; 40474#factFINAL assume true; 40473#factEXIT >#72#return; 39285#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 39286#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 39298#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 40507#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 40505#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 40501#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 40502#$Ultimate##0 ~n := #in~n; 40510#L25 assume !(~n <= 0); 40476#L26 call #t~ret0 := fact(~n - 1);< 40509#$Ultimate##0 ~n := #in~n; 40512#L25 assume ~n <= 0;#res := 1; 40511#factFINAL assume true; 40508#factEXIT >#66#return; 40506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40504#factFINAL assume true; 40500#factEXIT >#74#return; 40496#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 40498#$Ultimate##0 ~n := #in~n; 40503#L25 assume ~n <= 0;#res := 1; 40499#factFINAL assume true; 40495#factEXIT >#76#return; 40493#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 40494#$Ultimate##0 ~n := #in~n; 40529#L25 assume !(~n <= 0); 40527#L26 call #t~ret0 := fact(~n - 1);< 40528#$Ultimate##0 ~n := #in~n; 40542#L25 assume ~n <= 0;#res := 1; 40543#factFINAL assume true; 40526#factEXIT >#66#return; 40524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40522#factFINAL assume true; 40492#factEXIT >#78#return; 40491#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 40490#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 40489#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 40012#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 40011#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 39972#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 39380#L42-3 [2023-02-15 23:17:13,982 INFO L750 eck$LassoCheckResult]: Loop: 39380#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 39379#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 39340#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 39363#$Ultimate##0 ~n := #in~n; 39377#L25 assume !(~n <= 0); 39378#L26 call #t~ret0 := fact(~n - 1);< 39392#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39476#L25 assume ~n <= 0;#res := 1; 39475#factFINAL assume true; 39472#factEXIT >#66#return; 39470#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39466#factFINAL assume true; 39461#factEXIT >#66#return; 39464#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39357#factFINAL assume true; 39361#factEXIT >#68#return; 39332#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 39363#$Ultimate##0 ~n := #in~n; 39377#L25 assume ~n <= 0;#res := 1; 39376#factFINAL assume true; 39371#factEXIT >#70#return; 39360#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 39474#$Ultimate##0 ~n := #in~n; 39460#L25 assume !(~n <= 0); 39441#L26 call #t~ret0 := fact(~n - 1);< 39469#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39476#L25 assume ~n <= 0;#res := 1; 39475#factFINAL assume true; 39472#factEXIT >#66#return; 39470#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39466#factFINAL assume true; 39461#factEXIT >#66#return; 39459#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39455#factFINAL assume true; 39451#factEXIT >#66#return; 39444#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39446#factFINAL assume true; 39429#factEXIT >#66#return; 39428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39425#factFINAL assume true; 39424#factEXIT >#72#return; 39383#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 39420#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 39418#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 39393#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 39386#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 39350#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 39362#$Ultimate##0 ~n := #in~n; 39417#L25 assume !(~n <= 0); 39378#L26 call #t~ret0 := fact(~n - 1);< 39392#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39476#L25 assume ~n <= 0;#res := 1; 39475#factFINAL assume true; 39472#factEXIT >#66#return; 39470#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39466#factFINAL assume true; 39461#factEXIT >#66#return; 39464#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39357#factFINAL assume true; 39361#factEXIT >#68#return; 39333#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 39363#$Ultimate##0 ~n := #in~n; 39377#L25 assume !(~n <= 0); 39378#L26 call #t~ret0 := fact(~n - 1);< 39392#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39476#L25 assume ~n <= 0;#res := 1; 39475#factFINAL assume true; 39472#factEXIT >#66#return; 39470#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39466#factFINAL assume true; 39461#factEXIT >#66#return; 39459#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39455#factFINAL assume true; 39451#factEXIT >#66#return; 39444#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39446#factFINAL assume true; 39429#factEXIT >#66#return; 39428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39425#factFINAL assume true; 39424#factEXIT >#70#return; 39349#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 39363#$Ultimate##0 ~n := #in~n; 39377#L25 assume ~n <= 0;#res := 1; 39376#factFINAL assume true; 39371#factEXIT >#72#return; 39373#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 39450#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 39366#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 39367#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 39427#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 39345#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 39362#$Ultimate##0 ~n := #in~n; 39417#L25 assume !(~n <= 0); 39378#L26 call #t~ret0 := fact(~n - 1);< 39392#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39476#L25 assume ~n <= 0;#res := 1; 39475#factFINAL assume true; 39472#factEXIT >#66#return; 39470#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39466#factFINAL assume true; 39461#factEXIT >#66#return; 39464#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39357#factFINAL assume true; 39361#factEXIT >#74#return; 39341#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 39363#$Ultimate##0 ~n := #in~n; 39377#L25 assume !(~n <= 0); 39378#L26 call #t~ret0 := fact(~n - 1);< 39392#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39476#L25 assume ~n <= 0;#res := 1; 39475#factFINAL assume true; 39472#factEXIT >#66#return; 39470#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39466#factFINAL assume true; 39461#factEXIT >#66#return; 39459#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39455#factFINAL assume true; 39451#factEXIT >#66#return; 39444#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39446#factFINAL assume true; 39429#factEXIT >#66#return; 39428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39425#factFINAL assume true; 39424#factEXIT >#76#return; 39339#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 39362#$Ultimate##0 ~n := #in~n; 39417#L25 assume !(~n <= 0); 39378#L26 call #t~ret0 := fact(~n - 1);< 39392#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39421#L25 assume !(~n <= 0); 39433#L26 call #t~ret0 := fact(~n - 1);< 39473#$Ultimate##0 ~n := #in~n; 39476#L25 assume ~n <= 0;#res := 1; 39475#factFINAL assume true; 39472#factEXIT >#66#return; 39470#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39466#factFINAL assume true; 39461#factEXIT >#66#return; 39459#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39455#factFINAL assume true; 39451#factEXIT >#66#return; 39444#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39446#factFINAL assume true; 39429#factEXIT >#66#return; 39428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39425#factFINAL assume true; 39424#factEXIT >#78#return; 39329#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 39328#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 39327#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 39325#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 39287#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 39288#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 39380#L42-3 [2023-02-15 23:17:13,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:13,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 3 times [2023-02-15 23:17:13,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:13,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923657830] [2023-02-15 23:17:13,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:13,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:13,991 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:13,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57388487] [2023-02-15 23:17:13,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 23:17:13,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:13,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:13,993 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) [2023-02-15 23:17:13,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2023-02-15 23:17:14,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-02-15 23:17:14,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:17:14,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:17:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:17:14,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:17:14,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:14,086 INFO L85 PathProgramCache]: Analyzing trace with hash -297180909, now seen corresponding path program 5 times [2023-02-15 23:17:14,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:14,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349608686] [2023-02-15 23:17:14,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:14,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:14,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:14,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [538023844] [2023-02-15 23:17:14,093 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 23:17:14,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:14,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:14,098 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:14,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2023-02-15 23:17:14,220 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-02-15 23:17:14,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:17:14,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 23:17:14,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:17:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2339 backedges. 1346 proven. 186 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2023-02-15 23:17:14,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:17:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2339 backedges. 154 proven. 546 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2023-02-15 23:17:14,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:17:14,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349608686] [2023-02-15 23:17:14,971 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:17:14,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538023844] [2023-02-15 23:17:14,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538023844] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:17:14,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:17:14,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 20 [2023-02-15 23:17:14,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138745118] [2023-02-15 23:17:14,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:17:14,972 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:17:14,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:17:14,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 23:17:14,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2023-02-15 23:17:14,973 INFO L87 Difference]: Start difference. First operand 1619 states and 2790 transitions. cyclomatic complexity: 1198 Second operand has 20 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 20 states have internal predecessors, (57), 13 states have call successors, (23), 2 states have call predecessors, (23), 8 states have return successors, (25), 9 states have call predecessors, (25), 13 states have call successors, (25) [2023-02-15 23:17:15,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:17:15,766 INFO L93 Difference]: Finished difference Result 1991 states and 3409 transitions. [2023-02-15 23:17:15,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1991 states and 3409 transitions. [2023-02-15 23:17:15,781 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 206 [2023-02-15 23:17:15,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1991 states to 1988 states and 3406 transitions. [2023-02-15 23:17:15,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 495 [2023-02-15 23:17:15,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 498 [2023-02-15 23:17:15,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1988 states and 3406 transitions. [2023-02-15 23:17:15,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:17:15,806 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1988 states and 3406 transitions. [2023-02-15 23:17:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states and 3406 transitions. [2023-02-15 23:17:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1796. [2023-02-15 23:17:15,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1099 states have (on average 1.0727934485896269) internal successors, (1179), 1085 states have internal predecessors, (1179), 491 states have call successors, (510), 197 states have call predecessors, (510), 206 states have return successors, (1432), 513 states have call predecessors, (1432), 491 states have call successors, (1432) [2023-02-15 23:17:15,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 3121 transitions. [2023-02-15 23:17:15,860 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1796 states and 3121 transitions. [2023-02-15 23:17:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 23:17:15,861 INFO L428 stractBuchiCegarLoop]: Abstraction has 1796 states and 3121 transitions. [2023-02-15 23:17:15,861 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2023-02-15 23:17:15,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1796 states and 3121 transitions. [2023-02-15 23:17:15,868 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 167 [2023-02-15 23:17:15,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:17:15,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:17:15,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:15,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 12, 12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:15,870 INFO L748 eck$LassoCheckResult]: Stem: 44152#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 44090#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 44091#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 44111#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 44153#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 44409#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 44407#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 44404#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 44405#$Ultimate##0 ~n := #in~n; 44408#L25 assume ~n <= 0;#res := 1; 44406#factFINAL assume true; 44403#factEXIT >#68#return; 44134#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 44135#$Ultimate##0 ~n := #in~n; 44504#L25 assume ~n <= 0;#res := 1; 44503#factFINAL assume true; 44502#factEXIT >#70#return; 44077#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 44078#$Ultimate##0 ~n := #in~n; 44494#L25 assume ~n <= 0;#res := 1; 44493#factFINAL assume true; 44492#factEXIT >#72#return; 44491#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 44490#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 44488#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 44489#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 44549#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 44545#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 44548#$Ultimate##0 ~n := #in~n; 44562#L25 assume !(~n <= 0); 44495#L26 call #t~ret0 := fact(~n - 1);< 44560#$Ultimate##0 ~n := #in~n; 44577#L25 assume ~n <= 0;#res := 1; 44574#factFINAL assume true; 44559#factEXIT >#66#return; 44551#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44550#factFINAL assume true; 44544#factEXIT >#74#return; 44146#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 44147#$Ultimate##0 ~n := #in~n; 44673#L25 assume ~n <= 0;#res := 1; 44670#factFINAL assume true; 44669#factEXIT >#76#return; 44667#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 44668#$Ultimate##0 ~n := #in~n; 44900#L25 assume !(~n <= 0); 44898#L26 call #t~ret0 := fact(~n - 1);< 44899#$Ultimate##0 ~n := #in~n; 45117#L25 assume ~n <= 0;#res := 1; 45118#factFINAL assume true; 44897#factEXIT >#66#return; 44896#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44895#factFINAL assume true; 44666#factEXIT >#78#return; 44661#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 44655#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 44653#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 44651#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 44650#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 44615#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 44617#$Ultimate##0 ~n := #in~n; 44632#L25 assume !(~n <= 0); 44625#L26 call #t~ret0 := fact(~n - 1);< 44631#$Ultimate##0 ~n := #in~n; 44638#L25 assume !(~n <= 0); 44626#L26 call #t~ret0 := fact(~n - 1);< 44637#$Ultimate##0 ~n := #in~n; 44644#L25 assume ~n <= 0;#res := 1; 44642#factFINAL assume true; 44636#factEXIT >#66#return; 44635#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44633#factFINAL assume true; 44624#factEXIT >#66#return; 44623#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44621#factFINAL assume true; 44614#factEXIT >#74#return; 44140#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 44585#$Ultimate##0 ~n := #in~n; 44620#L25 assume ~n <= 0;#res := 1; 44619#factFINAL assume true; 44583#factEXIT >#76#return; 44122#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 44611#$Ultimate##0 ~n := #in~n; 44605#L25 assume !(~n <= 0); 44568#L26 call #t~ret0 := fact(~n - 1);< 44573#$Ultimate##0 ~n := #in~n; 44588#L25 assume !(~n <= 0); 44072#L26 call #t~ret0 := fact(~n - 1);< 44610#$Ultimate##0 ~n := #in~n; 44705#L25 assume ~n <= 0;#res := 1; 44085#factFINAL assume true; 44071#factEXIT >#66#return; 44073#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44601#factFINAL assume true; 44598#factEXIT >#66#return; 44121#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44123#factFINAL assume true; 44602#factEXIT >#78#return; 44163#L30-8 [2023-02-15 23:17:15,870 INFO L750 eck$LassoCheckResult]: Loop: 44163#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 44112#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 44113#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 44484#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 44116#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 44067#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 44068#$Ultimate##0 ~n := #in~n; 44582#L25 assume !(~n <= 0); 44564#L26 call #t~ret0 := fact(~n - 1);< 44573#$Ultimate##0 ~n := #in~n; 44588#L25 assume !(~n <= 0); 44072#L26 call #t~ret0 := fact(~n - 1);< 44610#$Ultimate##0 ~n := #in~n; 44588#L25 assume !(~n <= 0); 44072#L26 call #t~ret0 := fact(~n - 1);< 44610#$Ultimate##0 ~n := #in~n; 44588#L25 assume !(~n <= 0); 44072#L26 call #t~ret0 := fact(~n - 1);< 44610#$Ultimate##0 ~n := #in~n; 44588#L25 assume !(~n <= 0); 44072#L26 call #t~ret0 := fact(~n - 1);< 44610#$Ultimate##0 ~n := #in~n; 44588#L25 assume !(~n <= 0); 44072#L26 call #t~ret0 := fact(~n - 1);< 44610#$Ultimate##0 ~n := #in~n; 44705#L25 assume ~n <= 0;#res := 1; 44085#factFINAL assume true; 44071#factEXIT >#66#return; 44073#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44601#factFINAL assume true; 44598#factEXIT >#66#return; 44596#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44594#factFINAL assume true; 44593#factEXIT >#66#return; 44592#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44591#factFINAL assume true; 44590#factEXIT >#66#return; 44581#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44580#factFINAL assume true; 44578#factEXIT >#66#return; 44571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44575#factFINAL assume true; 44563#factEXIT >#66#return; 44561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44552#factFINAL assume true; 44546#factEXIT >#74#return; 44547#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 44556#$Ultimate##0 ~n := #in~n; 44558#L25 assume ~n <= 0;#res := 1; 44557#factFINAL assume true; 44555#factEXIT >#76#return; 44165#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 44553#$Ultimate##0 ~n := #in~n; 44589#L25 assume !(~n <= 0); 44565#L26 call #t~ret0 := fact(~n - 1);< 44098#$Ultimate##0 ~n := #in~n; 44603#L25 assume !(~n <= 0); 44569#L26 call #t~ret0 := fact(~n - 1);< 44576#$Ultimate##0 ~n := #in~n; 44613#L25 assume !(~n <= 0); 44567#L26 call #t~ret0 := fact(~n - 1);< 44599#$Ultimate##0 ~n := #in~n; 44588#L25 assume !(~n <= 0); 44072#L26 call #t~ret0 := fact(~n - 1);< 44610#$Ultimate##0 ~n := #in~n; 44588#L25 assume !(~n <= 0); 44072#L26 call #t~ret0 := fact(~n - 1);< 44610#$Ultimate##0 ~n := #in~n; 44588#L25 assume !(~n <= 0); 44072#L26 call #t~ret0 := fact(~n - 1);< 44610#$Ultimate##0 ~n := #in~n; 44705#L25 assume ~n <= 0;#res := 1; 44085#factFINAL assume true; 44071#factEXIT >#66#return; 44073#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44601#factFINAL assume true; 44598#factEXIT >#66#return; 44596#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44594#factFINAL assume true; 44593#factEXIT >#66#return; 44592#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44591#factFINAL assume true; 44590#factEXIT >#66#return; 44581#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44580#factFINAL assume true; 44578#factEXIT >#66#return; 44571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44575#factFINAL assume true; 44563#factEXIT >#66#return; 44561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44552#factFINAL assume true; 44546#factEXIT >#78#return; 44163#L30-8 [2023-02-15 23:17:15,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:15,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1326926298, now seen corresponding path program 3 times [2023-02-15 23:17:15,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:15,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398631303] [2023-02-15 23:17:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:15,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:15,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:15,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570818065] [2023-02-15 23:17:15,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 23:17:15,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:15,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:15,879 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:15,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2023-02-15 23:17:15,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-15 23:17:15,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:17:15,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:17:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:17:16,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:17:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2078612212, now seen corresponding path program 5 times [2023-02-15 23:17:16,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:16,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515857134] [2023-02-15 23:17:16,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:16,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:16,032 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:16,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [780555184] [2023-02-15 23:17:16,032 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 23:17:16,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:16,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:16,040 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:16,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2023-02-15 23:17:16,113 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2023-02-15 23:17:16,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:17:16,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:17:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:17:16,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:17:16,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:16,154 INFO L85 PathProgramCache]: Analyzing trace with hash 106246041, now seen corresponding path program 4 times [2023-02-15 23:17:16,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:16,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973803931] [2023-02-15 23:17:16,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:16,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:16,165 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:16,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [488022623] [2023-02-15 23:17:16,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 23:17:16,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:16,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:16,169 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:16,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2023-02-15 23:17:16,266 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 23:17:16,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:17:16,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 23:17:16,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:17:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 1130 proven. 45 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2023-02-15 23:17:16,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:17:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 282 proven. 198 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2023-02-15 23:17:16,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:17:16,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973803931] [2023-02-15 23:17:16,885 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:17:16,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488022623] [2023-02-15 23:17:16,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488022623] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:17:16,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:17:16,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 16 [2023-02-15 23:17:16,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457191315] [2023-02-15 23:17:16,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:17:18,382 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:17:18,382 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:17:18,382 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:17:18,382 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:17:18,382 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:17:18,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:17:18,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:17:18,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:17:18,383 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2023-02-15 23:17:18,383 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:17:18,383 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:17:18,384 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:17:18,386 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:17:18,387 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:17:18,388 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:17:18,390 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:17:18,516 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:17:18,517 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:17:18,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:17:18,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:18,519 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) [2023-02-15 23:17:18,520 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 [2023-02-15 23:17:18,521 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:17:18,521 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:17:18,534 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:17:18,534 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:17:18,537 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 [2023-02-15 23:17:18,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:17:18,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:18,538 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) [2023-02-15 23:17:18,540 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 [2023-02-15 23:17:18,541 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:17:18,541 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:17:18,549 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:17:18,549 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:17:18,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2023-02-15 23:17:18,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:17:18,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:18,553 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) [2023-02-15 23:17:18,555 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 [2023-02-15 23:17:18,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:17:18,556 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:17:18,563 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:17:18,563 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:17:18,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2023-02-15 23:17:18,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:17:18,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:18,567 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) [2023-02-15 23:17:18,568 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 [2023-02-15 23:17:18,570 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:17:18,570 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:17:18,577 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:17:18,578 INFO L440 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: [] [2023-02-15 23:17:18,581 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 [2023-02-15 23:17:18,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:17:18,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:18,582 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:17:18,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2023-02-15 23:17:18,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:17:18,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:17:18,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2023-02-15 23:17:18,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:17:18,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:18,616 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:17:18,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2023-02-15 23:17:18,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:17:18,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:17:18,632 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:17:18,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2023-02-15 23:17:18,636 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:17:18,636 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:17:18,636 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:17:18,636 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:17:18,636 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:17:18,636 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:17:18,636 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:17:18,636 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:17:18,636 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2023-02-15 23:17:18,636 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:17:18,636 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:17:18,638 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:17:18,641 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:17:18,667 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:17:18,668 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:17:18,670 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:17:18,774 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:17:18,775 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:17:18,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:17:18,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:18,776 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) [2023-02-15 23:17:18,777 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 [2023-02-15 23:17:18,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:17:18,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:17:18,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:17:18,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:17:18,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:17:18,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:17:18,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:17:18,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:17:18,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:17:18,790 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 [2023-02-15 23:17:18,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:17:18,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:18,791 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) [2023-02-15 23:17:18,793 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 [2023-02-15 23:17:18,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:17:18,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:17:18,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:17:18,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:17:18,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:17:18,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:17:18,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:17:18,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:17:18,805 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:17:18,808 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:17:18,808 INFO L444 ModelExtractionUtils]: 8 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 23:17:18,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:17:18,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:18,811 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) [2023-02-15 23:17:18,821 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 [2023-02-15 23:17:18,821 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:17:18,821 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:17:18,821 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:17:18,821 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 11 Supporting invariants [] [2023-02-15 23:17:18,824 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 [2023-02-15 23:17:18,824 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:17:18,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:17:18,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 23:17:18,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:17:19,229 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 [2023-02-15 23:17:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:17:19,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-15 23:17:19,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:17:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2023-02-15 23:17:19,759 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 13 loop predicates [2023-02-15 23:17:19,759 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1796 states and 3121 transitions. cyclomatic complexity: 1352 Second operand has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2023-02-15 23:17:20,109 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1796 states and 3121 transitions. cyclomatic complexity: 1352. Second operand has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) Result 3391 states and 5379 transitions. Complement of second has 65 states. [2023-02-15 23:17:20,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2023-02-15 23:17:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2023-02-15 23:17:20,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 91 transitions. [2023-02-15 23:17:20,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 91 transitions. Stem has 98 letters. Loop has 92 letters. [2023-02-15 23:17:20,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:17:20,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 91 transitions. Stem has 190 letters. Loop has 92 letters. [2023-02-15 23:17:20,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:17:20,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 91 transitions. Stem has 98 letters. Loop has 184 letters. [2023-02-15 23:17:20,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:17:20,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3391 states and 5379 transitions. [2023-02-15 23:17:20,138 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 167 [2023-02-15 23:17:20,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3391 states to 2526 states and 4159 transitions. [2023-02-15 23:17:20,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 500 [2023-02-15 23:17:20,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 503 [2023-02-15 23:17:20,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2526 states and 4159 transitions. [2023-02-15 23:17:20,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:17:20,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2526 states and 4159 transitions. [2023-02-15 23:17:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states and 4159 transitions. [2023-02-15 23:17:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2036. [2023-02-15 23:17:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2036 states, 1257 states have (on average 1.0652346857597454) internal successors, (1339), 1243 states have internal predecessors, (1339), 523 states have call successors, (552), 229 states have call predecessors, (552), 256 states have return successors, (1610), 563 states have call predecessors, (1610), 523 states have call successors, (1610) [2023-02-15 23:17:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 3501 transitions. [2023-02-15 23:17:20,286 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2036 states and 3501 transitions. [2023-02-15 23:17:20,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:17:20,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 23:17:20,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-02-15 23:17:20,287 INFO L87 Difference]: Start difference. First operand 2036 states and 3501 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (23), 9 states have call predecessors, (23), 11 states have call successors, (23) [2023-02-15 23:17:21,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:17:21,009 INFO L93 Difference]: Finished difference Result 2930 states and 5543 transitions. [2023-02-15 23:17:21,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2930 states and 5543 transitions. [2023-02-15 23:17:21,035 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 282 [2023-02-15 23:17:21,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2930 states to 2879 states and 5456 transitions. [2023-02-15 23:17:21,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 704 [2023-02-15 23:17:21,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 704 [2023-02-15 23:17:21,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2879 states and 5456 transitions. [2023-02-15 23:17:21,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:17:21,073 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2879 states and 5456 transitions. [2023-02-15 23:17:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states and 5456 transitions. [2023-02-15 23:17:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2317. [2023-02-15 23:17:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 1405 states have (on average 1.0704626334519574) internal successors, (1504), 1383 states have internal predecessors, (1504), 656 states have call successors, (686), 229 states have call predecessors, (686), 256 states have return successors, (2017), 704 states have call predecessors, (2017), 656 states have call successors, (2017) [2023-02-15 23:17:21,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 4207 transitions. [2023-02-15 23:17:21,156 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2317 states and 4207 transitions. [2023-02-15 23:17:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 23:17:21,157 INFO L428 stractBuchiCegarLoop]: Abstraction has 2317 states and 4207 transitions. [2023-02-15 23:17:21,157 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2023-02-15 23:17:21,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2317 states and 4207 transitions. [2023-02-15 23:17:21,166 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 213 [2023-02-15 23:17:21,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:17:21,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:17:21,168 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:21,168 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [31, 31, 22, 22, 22, 22, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:21,168 INFO L748 eck$LassoCheckResult]: Stem: 56145#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 56089#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 56090#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 56110#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 56098#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 56100#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 57594#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 56087#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 56088#$Ultimate##0 ~n := #in~n; 57796#L25 assume ~n <= 0;#res := 1; 57785#factFINAL assume true; 57768#factEXIT >#68#return; 56131#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 56132#$Ultimate##0 ~n := #in~n; 57783#L25 assume ~n <= 0;#res := 1; 57782#factFINAL assume true; 57753#factEXIT >#70#return; 56078#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 56079#$Ultimate##0 ~n := #in~n; 57860#L25 assume ~n <= 0;#res := 1; 57859#factFINAL assume true; 57858#factEXIT >#72#return; 56108#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 56109#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 56120#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 57957#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 57956#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 57954#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57955#$Ultimate##0 ~n := #in~n; 57966#L25 assume !(~n <= 0); 57861#L26 call #t~ret0 := fact(~n - 1);< 57963#$Ultimate##0 ~n := #in~n; 57968#L25 assume ~n <= 0;#res := 1; 57965#factFINAL assume true; 57962#factEXIT >#66#return; 57960#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57959#factFINAL assume true; 57953#factEXIT >#74#return; 57946#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 57948#$Ultimate##0 ~n := #in~n; 57951#L25 assume ~n <= 0;#res := 1; 57950#factFINAL assume true; 57945#factEXIT >#76#return; 57420#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 57931#$Ultimate##0 ~n := #in~n; 58368#L25 assume !(~n <= 0); 58364#L26 call #t~ret0 := fact(~n - 1);< 58367#$Ultimate##0 ~n := #in~n; 58377#L25 assume ~n <= 0;#res := 1; 58381#factFINAL assume true; 58366#factEXIT >#66#return; 58365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58361#factFINAL assume true; 57419#factEXIT >#78#return; 57417#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 57415#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 57412#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 57123#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 57113#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 56800#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 56333#L42-3 [2023-02-15 23:17:21,169 INFO L750 eck$LassoCheckResult]: Loop: 56333#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 56327#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 56202#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 56243#$Ultimate##0 ~n := #in~n; 56322#L25 assume !(~n <= 0); 56246#L26 call #t~ret0 := fact(~n - 1);< 56295#$Ultimate##0 ~n := #in~n; 56296#L25 assume !(~n <= 0); 56258#L26 call #t~ret0 := fact(~n - 1);< 56355#$Ultimate##0 ~n := #in~n; 56296#L25 assume !(~n <= 0); 56258#L26 call #t~ret0 := fact(~n - 1);< 56355#$Ultimate##0 ~n := #in~n; 56296#L25 assume !(~n <= 0); 56258#L26 call #t~ret0 := fact(~n - 1);< 56355#$Ultimate##0 ~n := #in~n; 56357#L25 assume ~n <= 0;#res := 1; 56356#factFINAL assume true; 56351#factEXIT >#66#return; 56353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56381#factFINAL assume true; 56375#factEXIT >#66#return; 56378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56387#factFINAL assume true; 56384#factEXIT >#66#return; 56262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56266#factFINAL assume true; 56245#factEXIT >#66#return; 56244#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56227#factFINAL assume true; 56241#factEXIT >#68#return; 56201#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 56243#$Ultimate##0 ~n := #in~n; 56322#L25 assume ~n <= 0;#res := 1; 56289#factFINAL assume true; 56343#factEXIT >#70#return; 56230#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 56371#$Ultimate##0 ~n := #in~n; 56370#L25 assume !(~n <= 0); 56249#L26 call #t~ret0 := fact(~n - 1);< 56365#$Ultimate##0 ~n := #in~n; 56363#L25 assume !(~n <= 0); 56252#L26 call #t~ret0 := fact(~n - 1);< 56283#$Ultimate##0 ~n := #in~n; 56282#L25 assume !(~n <= 0); 56250#L26 call #t~ret0 := fact(~n - 1);< 56281#$Ultimate##0 ~n := #in~n; 56296#L25 assume !(~n <= 0); 56258#L26 call #t~ret0 := fact(~n - 1);< 56355#$Ultimate##0 ~n := #in~n; 56357#L25 assume ~n <= 0;#res := 1; 56356#factFINAL assume true; 56351#factEXIT >#66#return; 56353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56381#factFINAL assume true; 56375#factEXIT >#66#return; 56378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56387#factFINAL assume true; 56384#factEXIT >#66#return; 56262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56266#factFINAL assume true; 56245#factEXIT >#66#return; 56244#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56227#factFINAL assume true; 56241#factEXIT >#72#return; 56325#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 56342#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 56338#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56339#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 56332#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 56174#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 56242#$Ultimate##0 ~n := #in~n; 56309#L25 assume !(~n <= 0); 56246#L26 call #t~ret0 := fact(~n - 1);< 56295#$Ultimate##0 ~n := #in~n; 56296#L25 assume !(~n <= 0); 56258#L26 call #t~ret0 := fact(~n - 1);< 56355#$Ultimate##0 ~n := #in~n; 56357#L25 assume ~n <= 0;#res := 1; 56356#factFINAL assume true; 56351#factEXIT >#66#return; 56353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56381#factFINAL assume true; 56375#factEXIT >#66#return; 56374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56373#factFINAL assume true; 56372#factEXIT >#68#return; 56182#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 56243#$Ultimate##0 ~n := #in~n; 56322#L25 assume !(~n <= 0); 56246#L26 call #t~ret0 := fact(~n - 1);< 56295#$Ultimate##0 ~n := #in~n; 56296#L25 assume !(~n <= 0); 56258#L26 call #t~ret0 := fact(~n - 1);< 56355#$Ultimate##0 ~n := #in~n; 56296#L25 assume !(~n <= 0); 56258#L26 call #t~ret0 := fact(~n - 1);< 56355#$Ultimate##0 ~n := #in~n; 56296#L25 assume !(~n <= 0); 56258#L26 call #t~ret0 := fact(~n - 1);< 56355#$Ultimate##0 ~n := #in~n; 56357#L25 assume ~n <= 0;#res := 1; 56356#factFINAL assume true; 56351#factEXIT >#66#return; 56353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56381#factFINAL assume true; 56375#factEXIT >#66#return; 56378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56387#factFINAL assume true; 56384#factEXIT >#66#return; 56262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56266#factFINAL assume true; 56245#factEXIT >#66#return; 56244#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56227#factFINAL assume true; 56241#factEXIT >#70#return; 56184#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 56243#$Ultimate##0 ~n := #in~n; 56322#L25 assume ~n <= 0;#res := 1; 56289#factFINAL assume true; 56343#factEXIT >#72#return; 56345#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 56409#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 56408#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56407#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 56406#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 56207#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 56242#$Ultimate##0 ~n := #in~n; 56309#L25 assume !(~n <= 0); 56246#L26 call #t~ret0 := fact(~n - 1);< 56295#$Ultimate##0 ~n := #in~n; 56296#L25 assume !(~n <= 0); 56258#L26 call #t~ret0 := fact(~n - 1);< 56355#$Ultimate##0 ~n := #in~n; 56357#L25 assume ~n <= 0;#res := 1; 56356#factFINAL assume true; 56351#factEXIT >#66#return; 56353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56381#factFINAL assume true; 56375#factEXIT >#66#return; 56374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56373#factFINAL assume true; 56372#factEXIT >#74#return; 56210#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 56290#$Ultimate##0 ~n := #in~n; 56288#L25 assume !(~n <= 0); 56264#L26 call #t~ret0 := fact(~n - 1);< 56265#$Ultimate##0 ~n := #in~n; 56294#L25 assume !(~n <= 0); 56352#L26 call #t~ret0 := fact(~n - 1);< 56354#$Ultimate##0 ~n := #in~n; 56357#L25 assume ~n <= 0;#res := 1; 56356#factFINAL assume true; 56351#factEXIT >#66#return; 56353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56381#factFINAL assume true; 56375#factEXIT >#66#return; 56374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56373#factFINAL assume true; 56372#factEXIT >#76#return; 56196#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 56242#$Ultimate##0 ~n := #in~n; 56309#L25 assume !(~n <= 0); 56246#L26 call #t~ret0 := fact(~n - 1);< 56295#$Ultimate##0 ~n := #in~n; 56296#L25 assume !(~n <= 0); 56258#L26 call #t~ret0 := fact(~n - 1);< 56355#$Ultimate##0 ~n := #in~n; 56296#L25 assume !(~n <= 0); 56258#L26 call #t~ret0 := fact(~n - 1);< 56355#$Ultimate##0 ~n := #in~n; 56296#L25 assume !(~n <= 0); 56258#L26 call #t~ret0 := fact(~n - 1);< 56355#$Ultimate##0 ~n := #in~n; 56357#L25 assume ~n <= 0;#res := 1; 56356#factFINAL assume true; 56351#factEXIT >#66#return; 56353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56381#factFINAL assume true; 56375#factEXIT >#66#return; 56378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56387#factFINAL assume true; 56384#factEXIT >#66#return; 56262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56266#factFINAL assume true; 56245#factEXIT >#66#return; 56244#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56227#factFINAL assume true; 56241#factEXIT >#78#return; 56223#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 56405#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 56403#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56150#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 56103#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 56104#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 56333#L42-3 [2023-02-15 23:17:21,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 4 times [2023-02-15 23:17:21,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:21,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80144897] [2023-02-15 23:17:21,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:21,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:21,175 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:21,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [690292244] [2023-02-15 23:17:21,176 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 23:17:21,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:21,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:21,177 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:21,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Waiting until timeout for monitored process [2023-02-15 23:17:21,276 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 23:17:21,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:17:21,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:17:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:17:21,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:17:21,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:21,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1181594349, now seen corresponding path program 6 times [2023-02-15 23:17:21,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:21,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985579484] [2023-02-15 23:17:21,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:21,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:21,312 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:21,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1249398617] [2023-02-15 23:17:21,312 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 23:17:21,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:21,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:21,314 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:21,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Waiting until timeout for monitored process [2023-02-15 23:17:21,432 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2023-02-15 23:17:21,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:17:21,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 23:17:21,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:17:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2339 backedges. 119 proven. 240 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2023-02-15 23:17:21,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:17:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2339 backedges. 119 proven. 241 refuted. 0 times theorem prover too weak. 1979 trivial. 0 not checked. [2023-02-15 23:17:22,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:17:22,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985579484] [2023-02-15 23:17:22,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:17:22,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249398617] [2023-02-15 23:17:22,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249398617] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:17:22,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:17:22,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 25 [2023-02-15 23:17:22,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840345362] [2023-02-15 23:17:22,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:17:22,063 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:17:22,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:17:22,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 23:17:22,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2023-02-15 23:17:22,064 INFO L87 Difference]: Start difference. First operand 2317 states and 4207 transitions. cyclomatic complexity: 1921 Second operand has 26 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 26 states have internal predecessors, (52), 13 states have call successors, (21), 1 states have call predecessors, (21), 4 states have return successors, (21), 10 states have call predecessors, (21), 13 states have call successors, (21) [2023-02-15 23:17:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:17:23,383 INFO L93 Difference]: Finished difference Result 3849 states and 7621 transitions. [2023-02-15 23:17:23,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3849 states and 7621 transitions. [2023-02-15 23:17:23,418 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 655 [2023-02-15 23:17:23,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3849 states to 3839 states and 7607 transitions. [2023-02-15 23:17:23,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1111 [2023-02-15 23:17:23,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1111 [2023-02-15 23:17:23,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3839 states and 7607 transitions. [2023-02-15 23:17:23,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:17:23,479 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3839 states and 7607 transitions. [2023-02-15 23:17:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states and 7607 transitions. [2023-02-15 23:17:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 2725. [2023-02-15 23:17:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2725 states, 1600 states have (on average 1.06625) internal successors, (1706), 1570 states have internal predecessors, (1706), 869 states have call successors, (899), 229 states have call predecessors, (899), 256 states have return successors, (2751), 925 states have call predecessors, (2751), 869 states have call successors, (2751) [2023-02-15 23:17:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2725 states and 5356 transitions. [2023-02-15 23:17:23,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2725 states and 5356 transitions. [2023-02-15 23:17:23,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 23:17:23,598 INFO L428 stractBuchiCegarLoop]: Abstraction has 2725 states and 5356 transitions. [2023-02-15 23:17:23,598 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2023-02-15 23:17:23,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2725 states and 5356 transitions. [2023-02-15 23:17:23,612 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 335 [2023-02-15 23:17:23,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:17:23,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:17:23,615 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:23,615 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [37, 37, 25, 25, 25, 25, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:23,615 INFO L748 eck$LassoCheckResult]: Stem: 63723#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 63661#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 63662#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 63686#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 63674#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 63676#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 65446#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 65442#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 65443#$Ultimate##0 ~n := #in~n; 65447#L25 assume ~n <= 0;#res := 1; 65445#factFINAL assume true; 65441#factEXIT >#68#return; 65437#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 65438#$Ultimate##0 ~n := #in~n; 65444#L25 assume ~n <= 0;#res := 1; 65440#factFINAL assume true; 65436#factEXIT >#70#return; 65416#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 65434#$Ultimate##0 ~n := #in~n; 65439#L25 assume ~n <= 0;#res := 1; 65435#factFINAL assume true; 65433#factEXIT >#72#return; 65432#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 65430#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 65427#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 65423#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 65421#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 65417#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 65418#$Ultimate##0 ~n := #in~n; 65429#L25 assume !(~n <= 0); 65425#L26 call #t~ret0 := fact(~n - 1);< 65426#$Ultimate##0 ~n := #in~n; 65431#L25 assume ~n <= 0;#res := 1; 65428#factFINAL assume true; 65424#factEXIT >#66#return; 65422#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65420#factFINAL assume true; 65415#factEXIT >#74#return; 65411#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 65413#$Ultimate##0 ~n := #in~n; 65419#L25 assume ~n <= 0;#res := 1; 65414#factFINAL assume true; 65410#factEXIT >#76#return; 65146#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 65409#$Ultimate##0 ~n := #in~n; 65643#L25 assume !(~n <= 0); 65535#L26 call #t~ret0 := fact(~n - 1);< 65536#$Ultimate##0 ~n := #in~n; 65718#L25 assume ~n <= 0;#res := 1; 65719#factFINAL assume true; 65534#factEXIT >#66#return; 65532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65408#factFINAL assume true; 65145#factEXIT >#78#return; 65147#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 65685#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 65683#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 64727#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 63684#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 63685#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 63962#L42-3 [2023-02-15 23:17:23,615 INFO L750 eck$LassoCheckResult]: Loop: 63962#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63960#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 63791#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63852#$Ultimate##0 ~n := #in~n; 63920#L25 assume !(~n <= 0); 63857#L26 call #t~ret0 := fact(~n - 1);< 63891#$Ultimate##0 ~n := #in~n; 63892#L25 assume !(~n <= 0); 63877#L26 call #t~ret0 := fact(~n - 1);< 63930#$Ultimate##0 ~n := #in~n; 63892#L25 assume !(~n <= 0); 63877#L26 call #t~ret0 := fact(~n - 1);< 63930#$Ultimate##0 ~n := #in~n; 63933#L25 assume ~n <= 0;#res := 1; 63932#factFINAL assume true; 63926#factEXIT >#66#return; 63928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63969#factFINAL assume true; 63966#factEXIT >#66#return; 63889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63890#factFINAL assume true; 64043#factEXIT >#66#return; 64039#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64030#factFINAL assume true; 64025#factEXIT >#68#return; 63753#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63852#$Ultimate##0 ~n := #in~n; 63920#L25 assume ~n <= 0;#res := 1; 63915#factFINAL assume true; 63948#factEXIT >#70#return; 63847#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63955#$Ultimate##0 ~n := #in~n; 63947#L25 assume !(~n <= 0); 63867#L26 call #t~ret0 := fact(~n - 1);< 63884#$Ultimate##0 ~n := #in~n; 63885#L25 assume !(~n <= 0); 63876#L26 call #t~ret0 := fact(~n - 1);< 63882#$Ultimate##0 ~n := #in~n; 63892#L25 assume !(~n <= 0); 63877#L26 call #t~ret0 := fact(~n - 1);< 63930#$Ultimate##0 ~n := #in~n; 63933#L25 assume ~n <= 0;#res := 1; 63932#factFINAL assume true; 63926#factEXIT >#66#return; 63928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63969#factFINAL assume true; 63966#factEXIT >#66#return; 63889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63890#factFINAL assume true; 64043#factEXIT >#66#return; 64039#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64030#factFINAL assume true; 64025#factEXIT >#72#return; 64027#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 64193#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 64187#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 64188#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 64176#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 63769#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63851#$Ultimate##0 ~n := #in~n; 63913#L25 assume !(~n <= 0); 63857#L26 call #t~ret0 := fact(~n - 1);< 63891#$Ultimate##0 ~n := #in~n; 63892#L25 assume !(~n <= 0); 63877#L26 call #t~ret0 := fact(~n - 1);< 63930#$Ultimate##0 ~n := #in~n; 63933#L25 assume ~n <= 0;#res := 1; 63932#factFINAL assume true; 63926#factEXIT >#66#return; 63928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63969#factFINAL assume true; 63966#factEXIT >#66#return; 63963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63961#factFINAL assume true; 63956#factEXIT >#68#return; 63811#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63852#$Ultimate##0 ~n := #in~n; 63920#L25 assume !(~n <= 0); 63857#L26 call #t~ret0 := fact(~n - 1);< 63891#$Ultimate##0 ~n := #in~n; 63892#L25 assume !(~n <= 0); 63877#L26 call #t~ret0 := fact(~n - 1);< 63930#$Ultimate##0 ~n := #in~n; 63933#L25 assume ~n <= 0;#res := 1; 63932#factFINAL assume true; 63926#factEXIT >#66#return; 63928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63969#factFINAL assume true; 63966#factEXIT >#66#return; 63963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63961#factFINAL assume true; 63956#factEXIT >#70#return; 63813#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63852#$Ultimate##0 ~n := #in~n; 63920#L25 assume !(~n <= 0); 63857#L26 call #t~ret0 := fact(~n - 1);< 63891#$Ultimate##0 ~n := #in~n; 63892#L25 assume !(~n <= 0); 63877#L26 call #t~ret0 := fact(~n - 1);< 63930#$Ultimate##0 ~n := #in~n; 63933#L25 assume ~n <= 0;#res := 1; 63932#factFINAL assume true; 63926#factEXIT >#66#return; 63928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63969#factFINAL assume true; 63966#factEXIT >#66#return; 63963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63961#factFINAL assume true; 63956#factEXIT >#72#return; 63830#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 64254#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 64253#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 64252#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 64247#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 63776#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63851#$Ultimate##0 ~n := #in~n; 63913#L25 assume !(~n <= 0); 63857#L26 call #t~ret0 := fact(~n - 1);< 63891#$Ultimate##0 ~n := #in~n; 63892#L25 assume !(~n <= 0); 63877#L26 call #t~ret0 := fact(~n - 1);< 63930#$Ultimate##0 ~n := #in~n; 63892#L25 assume !(~n <= 0); 63877#L26 call #t~ret0 := fact(~n - 1);< 63930#$Ultimate##0 ~n := #in~n; 63892#L25 assume !(~n <= 0); 63877#L26 call #t~ret0 := fact(~n - 1);< 63930#$Ultimate##0 ~n := #in~n; 63933#L25 assume ~n <= 0;#res := 1; 63932#factFINAL assume true; 63926#factEXIT >#66#return; 63928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63969#factFINAL assume true; 63966#factEXIT >#66#return; 63889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63890#factFINAL assume true; 64043#factEXIT >#66#return; 63924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63866#factFINAL assume true; 63878#factEXIT >#66#return; 63853#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63834#factFINAL assume true; 63850#factEXIT >#68#return; 63797#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63916#$Ultimate##0 ~n := #in~n; 63914#L25 assume !(~n <= 0); 63860#L26 call #t~ret0 := fact(~n - 1);< 63893#$Ultimate##0 ~n := #in~n; 63894#L25 assume !(~n <= 0); 63927#L26 call #t~ret0 := fact(~n - 1);< 63929#$Ultimate##0 ~n := #in~n; 63933#L25 assume ~n <= 0;#res := 1; 63932#factFINAL assume true; 63926#factEXIT >#66#return; 63928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63969#factFINAL assume true; 63966#factEXIT >#66#return; 63963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63961#factFINAL assume true; 63956#factEXIT >#70#return; 63739#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63852#$Ultimate##0 ~n := #in~n; 63920#L25 assume ~n <= 0;#res := 1; 63915#factFINAL assume true; 63948#factEXIT >#72#return; 63949#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 64221#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 64220#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 64092#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 64052#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 63790#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63851#$Ultimate##0 ~n := #in~n; 63913#L25 assume !(~n <= 0); 63857#L26 call #t~ret0 := fact(~n - 1);< 63891#$Ultimate##0 ~n := #in~n; 63892#L25 assume !(~n <= 0); 63877#L26 call #t~ret0 := fact(~n - 1);< 63930#$Ultimate##0 ~n := #in~n; 63892#L25 assume !(~n <= 0); 63877#L26 call #t~ret0 := fact(~n - 1);< 63930#$Ultimate##0 ~n := #in~n; 63933#L25 assume ~n <= 0;#res := 1; 63932#factFINAL assume true; 63926#factEXIT >#66#return; 63928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63969#factFINAL assume true; 63966#factEXIT >#66#return; 63889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63890#factFINAL assume true; 64043#factEXIT >#66#return; 64039#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64030#factFINAL assume true; 64025#factEXIT >#74#return; 63801#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63916#$Ultimate##0 ~n := #in~n; 63914#L25 assume !(~n <= 0); 63860#L26 call #t~ret0 := fact(~n - 1);< 63893#$Ultimate##0 ~n := #in~n; 63894#L25 assume !(~n <= 0); 63927#L26 call #t~ret0 := fact(~n - 1);< 63929#$Ultimate##0 ~n := #in~n; 63933#L25 assume ~n <= 0;#res := 1; 63932#factFINAL assume true; 63926#factEXIT >#66#return; 63928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63969#factFINAL assume true; 63966#factEXIT >#66#return; 63963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63961#factFINAL assume true; 63956#factEXIT >#76#return; 63745#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63851#$Ultimate##0 ~n := #in~n; 63913#L25 assume !(~n <= 0); 63857#L26 call #t~ret0 := fact(~n - 1);< 63891#$Ultimate##0 ~n := #in~n; 63892#L25 assume !(~n <= 0); 63877#L26 call #t~ret0 := fact(~n - 1);< 63930#$Ultimate##0 ~n := #in~n; 63933#L25 assume ~n <= 0;#res := 1; 63932#factFINAL assume true; 63926#factEXIT >#66#return; 63928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63969#factFINAL assume true; 63966#factEXIT >#66#return; 63963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63961#factFINAL assume true; 63956#factEXIT >#78#return; 63821#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 63733#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 63728#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 63729#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 63682#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 63683#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 63962#L42-3 [2023-02-15 23:17:23,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:23,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 5 times [2023-02-15 23:17:23,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:23,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686762314] [2023-02-15 23:17:23,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:23,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:23,622 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:23,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1530432371] [2023-02-15 23:17:23,623 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 23:17:23,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:23,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:23,629 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:23,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (171)] Waiting until timeout for monitored process [2023-02-15 23:17:23,705 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-02-15 23:17:23,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:17:23,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:17:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:17:23,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:17:23,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:23,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1907915622, now seen corresponding path program 7 times [2023-02-15 23:17:23,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:23,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217055794] [2023-02-15 23:17:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:23,740 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:23,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1467671179] [2023-02-15 23:17:23,742 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 23:17:23,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:23,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:23,744 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:23,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Waiting until timeout for monitored process [2023-02-15 23:17:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:17:23,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 23:17:23,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:17:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3301 backedges. 1578 proven. 115 refuted. 0 times theorem prover too weak. 1608 trivial. 0 not checked. [2023-02-15 23:17:23,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:17:24,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3301 backedges. 106 proven. 743 refuted. 0 times theorem prover too weak. 2452 trivial. 0 not checked. [2023-02-15 23:17:24,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:17:24,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217055794] [2023-02-15 23:17:24,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:17:24,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467671179] [2023-02-15 23:17:24,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467671179] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:17:24,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:17:24,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 20 [2023-02-15 23:17:24,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194209621] [2023-02-15 23:17:24,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:17:24,530 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:17:24,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:17:24,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 23:17:24,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2023-02-15 23:17:24,531 INFO L87 Difference]: Start difference. First operand 2725 states and 5356 transitions. cyclomatic complexity: 2662 Second operand has 20 states, 17 states have (on average 3.411764705882353) internal successors, (58), 20 states have internal predecessors, (58), 13 states have call successors, (26), 2 states have call predecessors, (26), 8 states have return successors, (28), 8 states have call predecessors, (28), 13 states have call successors, (28) [2023-02-15 23:17:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:17:25,126 INFO L93 Difference]: Finished difference Result 3587 states and 6732 transitions. [2023-02-15 23:17:25,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3587 states and 6732 transitions. [2023-02-15 23:17:25,156 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 556 [2023-02-15 23:17:25,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3587 states to 3113 states and 5556 transitions. [2023-02-15 23:17:25,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 994 [2023-02-15 23:17:25,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 998 [2023-02-15 23:17:25,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3113 states and 5556 transitions. [2023-02-15 23:17:25,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:17:25,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3113 states and 5556 transitions. [2023-02-15 23:17:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states and 5556 transitions. [2023-02-15 23:17:25,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 2809. [2023-02-15 23:17:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 1733 states have (on average 1.0692440854010388) internal successors, (1853), 1698 states have internal predecessors, (1853), 820 states have call successors, (850), 229 states have call predecessors, (850), 256 states have return successors, (2453), 881 states have call predecessors, (2453), 820 states have call successors, (2453) [2023-02-15 23:17:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 5156 transitions. [2023-02-15 23:17:25,309 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2809 states and 5156 transitions. [2023-02-15 23:17:25,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 23:17:25,310 INFO L428 stractBuchiCegarLoop]: Abstraction has 2809 states and 5156 transitions. [2023-02-15 23:17:25,310 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2023-02-15 23:17:25,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2809 states and 5156 transitions. [2023-02-15 23:17:25,321 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 483 [2023-02-15 23:17:25,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:17:25,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:17:25,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:25,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [33, 33, 21, 21, 21, 21, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:25,323 INFO L748 eck$LassoCheckResult]: Stem: 71388#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 71328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 71329#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 71350#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 71338#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 71340#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 73368#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 71315#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 71316#$Ultimate##0 ~n := #in~n; 73384#L25 assume ~n <= 0;#res := 1; 73383#factFINAL assume true; 73382#factEXIT >#68#return; 71375#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 71376#$Ultimate##0 ~n := #in~n; 73370#L25 assume ~n <= 0;#res := 1; 73369#factFINAL assume true; 73367#factEXIT >#70#return; 71313#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 71314#$Ultimate##0 ~n := #in~n; 73499#L25 assume ~n <= 0;#res := 1; 73498#factFINAL assume true; 73496#factEXIT >#72#return; 73497#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 71359#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 71360#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 73661#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 73659#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 73655#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 73656#$Ultimate##0 ~n := #in~n; 73665#L25 assume !(~n <= 0); 73500#L26 call #t~ret0 := fact(~n - 1);< 73663#$Ultimate##0 ~n := #in~n; 73666#L25 assume ~n <= 0;#res := 1; 73664#factFINAL assume true; 73662#factEXIT >#66#return; 73660#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73658#factFINAL assume true; 73654#factEXIT >#74#return; 73519#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 73651#$Ultimate##0 ~n := #in~n; 73675#L25 assume ~n <= 0;#res := 1; 73673#factFINAL assume true; 73518#factEXIT >#76#return; 73520#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 73684#$Ultimate##0 ~n := #in~n; 73710#L25 assume !(~n <= 0); 73707#L26 call #t~ret0 := fact(~n - 1);< 73708#$Ultimate##0 ~n := #in~n; 73979#L25 assume ~n <= 0;#res := 1; 74035#factFINAL assume true; 73706#factEXIT >#66#return; 73703#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73701#factFINAL assume true; 73683#factEXIT >#78#return; 73681#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 73680#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 73679#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 72685#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 72541#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 72542#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 71761#L42-3 [2023-02-15 23:17:25,324 INFO L750 eck$LassoCheckResult]: Loop: 71761#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 71751#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 71561#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 71589#$Ultimate##0 ~n := #in~n; 71750#L25 assume !(~n <= 0); 71629#L26 call #t~ret0 := fact(~n - 1);< 71654#$Ultimate##0 ~n := #in~n; 71655#L25 assume !(~n <= 0); 71639#L26 call #t~ret0 := fact(~n - 1);< 71694#$Ultimate##0 ~n := #in~n; 71697#L25 assume ~n <= 0;#res := 1; 71695#factFINAL assume true; 71690#factEXIT >#66#return; 71692#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71759#factFINAL assume true; 71755#factEXIT >#66#return; 71754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71752#factFINAL assume true; 71745#factEXIT >#68#return; 71488#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 71589#$Ultimate##0 ~n := #in~n; 71750#L25 assume ~n <= 0;#res := 1; 71728#factFINAL assume true; 71735#factEXIT >#70#return; 71616#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 71734#$Ultimate##0 ~n := #in~n; 71733#L25 assume !(~n <= 0); 71641#L26 call #t~ret0 := fact(~n - 1);< 71731#$Ultimate##0 ~n := #in~n; 71655#L25 assume !(~n <= 0); 71639#L26 call #t~ret0 := fact(~n - 1);< 71694#$Ultimate##0 ~n := #in~n; 71697#L25 assume ~n <= 0;#res := 1; 71695#factFINAL assume true; 71690#factEXIT >#66#return; 71692#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71759#factFINAL assume true; 71755#factEXIT >#66#return; 71754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71752#factFINAL assume true; 71745#factEXIT >#72#return; 71748#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 71893#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 71892#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 71891#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 71889#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 71500#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 71749#$Ultimate##0 ~n := #in~n; 71687#L25 assume !(~n <= 0); 71629#L26 call #t~ret0 := fact(~n - 1);< 71654#$Ultimate##0 ~n := #in~n; 71655#L25 assume !(~n <= 0); 71639#L26 call #t~ret0 := fact(~n - 1);< 71694#$Ultimate##0 ~n := #in~n; 71697#L25 assume ~n <= 0;#res := 1; 71695#factFINAL assume true; 71690#factEXIT >#66#return; 71692#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71759#factFINAL assume true; 71755#factEXIT >#66#return; 71754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71752#factFINAL assume true; 71745#factEXIT >#68#return; 71557#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 71729#$Ultimate##0 ~n := #in~n; 71727#L25 assume !(~n <= 0); 71627#L26 call #t~ret0 := fact(~n - 1);< 71656#$Ultimate##0 ~n := #in~n; 71696#L25 assume !(~n <= 0); 71691#L26 call #t~ret0 := fact(~n - 1);< 71693#$Ultimate##0 ~n := #in~n; 71697#L25 assume ~n <= 0;#res := 1; 71695#factFINAL assume true; 71690#factEXIT >#66#return; 71692#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71759#factFINAL assume true; 71755#factEXIT >#66#return; 71754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71752#factFINAL assume true; 71745#factEXIT >#70#return; 71556#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 71589#$Ultimate##0 ~n := #in~n; 71750#L25 assume !(~n <= 0); 71629#L26 call #t~ret0 := fact(~n - 1);< 71654#$Ultimate##0 ~n := #in~n; 71655#L25 assume !(~n <= 0); 71639#L26 call #t~ret0 := fact(~n - 1);< 71694#$Ultimate##0 ~n := #in~n; 71697#L25 assume ~n <= 0;#res := 1; 71695#factFINAL assume true; 71690#factEXIT >#66#return; 71692#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71759#factFINAL assume true; 71755#factEXIT >#66#return; 71754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71752#factFINAL assume true; 71745#factEXIT >#72#return; 71581#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 71905#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 71836#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 71837#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 71840#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 71558#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 71749#$Ultimate##0 ~n := #in~n; 71687#L25 assume !(~n <= 0); 71629#L26 call #t~ret0 := fact(~n - 1);< 71654#$Ultimate##0 ~n := #in~n; 71655#L25 assume !(~n <= 0); 71639#L26 call #t~ret0 := fact(~n - 1);< 71694#$Ultimate##0 ~n := #in~n; 71697#L25 assume ~n <= 0;#res := 1; 71695#factFINAL assume true; 71690#factEXIT >#66#return; 71692#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71759#factFINAL assume true; 71755#factEXIT >#66#return; 71754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71752#factFINAL assume true; 71745#factEXIT >#68#return; 71532#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 71729#$Ultimate##0 ~n := #in~n; 71727#L25 assume !(~n <= 0); 71627#L26 call #t~ret0 := fact(~n - 1);< 71656#$Ultimate##0 ~n := #in~n; 71696#L25 assume !(~n <= 0); 71691#L26 call #t~ret0 := fact(~n - 1);< 71693#$Ultimate##0 ~n := #in~n; 71697#L25 assume ~n <= 0;#res := 1; 71695#factFINAL assume true; 71690#factEXIT >#66#return; 71692#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71759#factFINAL assume true; 71755#factEXIT >#66#return; 71754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71752#factFINAL assume true; 71745#factEXIT >#70#return; 71496#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 71589#$Ultimate##0 ~n := #in~n; 71750#L25 assume ~n <= 0;#res := 1; 71728#factFINAL assume true; 71735#factEXIT >#72#return; 71737#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 71834#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 71833#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 71832#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 71831#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 71498#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 71749#$Ultimate##0 ~n := #in~n; 71687#L25 assume !(~n <= 0); 71629#L26 call #t~ret0 := fact(~n - 1);< 71654#$Ultimate##0 ~n := #in~n; 71655#L25 assume !(~n <= 0); 71639#L26 call #t~ret0 := fact(~n - 1);< 71694#$Ultimate##0 ~n := #in~n; 71655#L25 assume !(~n <= 0); 71639#L26 call #t~ret0 := fact(~n - 1);< 71694#$Ultimate##0 ~n := #in~n; 71697#L25 assume ~n <= 0;#res := 1; 71695#factFINAL assume true; 71690#factEXIT >#66#return; 71692#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71759#factFINAL assume true; 71755#factEXIT >#66#return; 71756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71885#factFINAL assume true; 71883#factEXIT >#66#return; 71830#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71784#factFINAL assume true; 71785#factEXIT >#74#return; 71542#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 71729#$Ultimate##0 ~n := #in~n; 71727#L25 assume !(~n <= 0); 71627#L26 call #t~ret0 := fact(~n - 1);< 71656#$Ultimate##0 ~n := #in~n; 71696#L25 assume !(~n <= 0); 71691#L26 call #t~ret0 := fact(~n - 1);< 71693#$Ultimate##0 ~n := #in~n; 71697#L25 assume ~n <= 0;#res := 1; 71695#factFINAL assume true; 71690#factEXIT >#66#return; 71692#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71759#factFINAL assume true; 71755#factEXIT >#66#return; 71754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71752#factFINAL assume true; 71745#factEXIT >#76#return; 71525#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 71749#$Ultimate##0 ~n := #in~n; 71687#L25 assume !(~n <= 0); 71629#L26 call #t~ret0 := fact(~n - 1);< 71654#$Ultimate##0 ~n := #in~n; 71655#L25 assume !(~n <= 0); 71639#L26 call #t~ret0 := fact(~n - 1);< 71694#$Ultimate##0 ~n := #in~n; 71697#L25 assume ~n <= 0;#res := 1; 71695#factFINAL assume true; 71690#factEXIT >#66#return; 71692#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71759#factFINAL assume true; 71755#factEXIT >#66#return; 71754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71752#factFINAL assume true; 71745#factEXIT >#78#return; 71485#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 71486#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 71481#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 71482#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 71775#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 71770#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 71761#L42-3 [2023-02-15 23:17:25,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 6 times [2023-02-15 23:17:25,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:25,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627909745] [2023-02-15 23:17:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:25,329 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:25,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8328635] [2023-02-15 23:17:25,330 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 23:17:25,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:25,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:25,337 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:25,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Waiting until timeout for monitored process [2023-02-15 23:17:25,412 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-02-15 23:17:25,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:17:25,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:17:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:17:25,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:17:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:25,440 INFO L85 PathProgramCache]: Analyzing trace with hash -329040822, now seen corresponding path program 8 times [2023-02-15 23:17:25,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:25,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820856776] [2023-02-15 23:17:25,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:25,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:25,449 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:25,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [659052922] [2023-02-15 23:17:25,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:17:25,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:25,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:25,453 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:25,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Waiting until timeout for monitored process [2023-02-15 23:17:25,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:17:25,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:17:25,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 23:17:25,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:17:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 1367 proven. 32 refuted. 0 times theorem prover too weak. 1170 trivial. 0 not checked. [2023-02-15 23:17:25,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:17:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 119 proven. 265 refuted. 0 times theorem prover too weak. 2185 trivial. 0 not checked. [2023-02-15 23:17:25,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:17:25,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820856776] [2023-02-15 23:17:25,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:17:25,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659052922] [2023-02-15 23:17:25,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659052922] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:17:25,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:17:25,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2023-02-15 23:17:25,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420704549] [2023-02-15 23:17:25,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:17:25,955 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:17:25,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:17:25,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 23:17:25,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-02-15 23:17:25,955 INFO L87 Difference]: Start difference. First operand 2809 states and 5156 transitions. cyclomatic complexity: 2383 Second operand has 15 states, 12 states have (on average 3.75) internal successors, (45), 15 states have internal predecessors, (45), 9 states have call successors, (24), 2 states have call predecessors, (24), 5 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2023-02-15 23:17:26,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:17:26,313 INFO L93 Difference]: Finished difference Result 3139 states and 5673 transitions. [2023-02-15 23:17:26,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3139 states and 5673 transitions. [2023-02-15 23:17:26,338 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 621 [2023-02-15 23:17:26,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3139 states to 3139 states and 5673 transitions. [2023-02-15 23:17:26,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1049 [2023-02-15 23:17:26,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1049 [2023-02-15 23:17:26,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3139 states and 5673 transitions. [2023-02-15 23:17:26,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:17:26,373 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3139 states and 5673 transitions. [2023-02-15 23:17:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states and 5673 transitions. [2023-02-15 23:17:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2884. [2023-02-15 23:17:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 1775 states have (on average 1.0676056338028168) internal successors, (1895), 1754 states have internal predecessors, (1895), 853 states have call successors, (883), 229 states have call predecessors, (883), 256 states have return successors, (2484), 900 states have call predecessors, (2484), 853 states have call successors, (2484) [2023-02-15 23:17:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 5262 transitions. [2023-02-15 23:17:26,466 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2884 states and 5262 transitions. [2023-02-15 23:17:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 23:17:26,467 INFO L428 stractBuchiCegarLoop]: Abstraction has 2884 states and 5262 transitions. [2023-02-15 23:17:26,467 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2023-02-15 23:17:26,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2884 states and 5262 transitions. [2023-02-15 23:17:26,479 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 521 [2023-02-15 23:17:26,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:17:26,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:17:26,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:26,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [32, 32, 20, 20, 20, 20, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:26,482 INFO L748 eck$LassoCheckResult]: Stem: 78616#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 78558#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 78559#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 78580#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 78617#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 79123#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80598#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 78552#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 78553#$Ultimate##0 ~n := #in~n; 80669#L25 assume ~n <= 0;#res := 1; 80668#factFINAL assume true; 80635#factEXIT >#68#return; 80589#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80590#$Ultimate##0 ~n := #in~n; 80601#L25 assume ~n <= 0;#res := 1; 80600#factFINAL assume true; 80588#factEXIT >#70#return; 78550#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 78551#$Ultimate##0 ~n := #in~n; 80821#L25 assume ~n <= 0;#res := 1; 80820#factFINAL assume true; 80819#factEXIT >#72#return; 80818#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 78587#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 78588#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 80902#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80900#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 80893#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80894#$Ultimate##0 ~n := #in~n; 80903#L25 assume !(~n <= 0); 80822#L26 call #t~ret0 := fact(~n - 1);< 80899#$Ultimate##0 ~n := #in~n; 80904#L25 assume ~n <= 0;#res := 1; 80901#factFINAL assume true; 80898#factEXIT >#66#return; 80897#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80896#factFINAL assume true; 80892#factEXIT >#74#return; 80824#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80888#$Ultimate##0 ~n := #in~n; 81010#L25 assume ~n <= 0;#res := 1; 81009#factFINAL assume true; 80823#factEXIT >#76#return; 80513#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80514#$Ultimate##0 ~n := #in~n; 80939#L25 assume !(~n <= 0); 80937#L26 call #t~ret0 := fact(~n - 1);< 80938#$Ultimate##0 ~n := #in~n; 81018#L25 assume ~n <= 0;#res := 1; 81019#factFINAL assume true; 80936#factEXIT >#66#return; 80933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80840#factFINAL assume true; 80512#factEXIT >#78#return; 80455#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 80419#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 80420#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 79965#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 79963#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 79961#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 78977#L42-3 [2023-02-15 23:17:26,482 INFO L750 eck$LassoCheckResult]: Loop: 78977#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 78967#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 78727#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 78858#$Ultimate##0 ~n := #in~n; 78951#L25 assume !(~n <= 0); 78871#L26 call #t~ret0 := fact(~n - 1);< 78902#$Ultimate##0 ~n := #in~n; 78893#L25 assume !(~n <= 0); 78877#L26 call #t~ret0 := fact(~n - 1);< 79001#$Ultimate##0 ~n := #in~n; 79004#L25 assume ~n <= 0;#res := 1; 79003#factFINAL assume true; 78998#factEXIT >#66#return; 78996#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78993#factFINAL assume true; 78987#factEXIT >#66#return; 78985#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78838#factFINAL assume true; 78857#factEXIT >#68#return; 78728#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 78858#$Ultimate##0 ~n := #in~n; 78951#L25 assume ~n <= 0;#res := 1; 78927#factFINAL assume true; 78957#factEXIT >#70#return; 78795#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 78956#$Ultimate##0 ~n := #in~n; 78995#L25 assume !(~n <= 0); 78882#L26 call #t~ret0 := fact(~n - 1);< 78991#$Ultimate##0 ~n := #in~n; 78893#L25 assume !(~n <= 0); 78877#L26 call #t~ret0 := fact(~n - 1);< 79001#$Ultimate##0 ~n := #in~n; 79004#L25 assume ~n <= 0;#res := 1; 79003#factFINAL assume true; 78998#factEXIT >#66#return; 78996#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78993#factFINAL assume true; 78987#factEXIT >#66#return; 78985#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78838#factFINAL assume true; 78857#factEXIT >#72#return; 78833#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 78976#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 78975#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 78974#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 78970#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 78731#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 78953#$Ultimate##0 ~n := #in~n; 78928#L25 assume !(~n <= 0); 78871#L26 call #t~ret0 := fact(~n - 1);< 78902#$Ultimate##0 ~n := #in~n; 78893#L25 assume !(~n <= 0); 78877#L26 call #t~ret0 := fact(~n - 1);< 79001#$Ultimate##0 ~n := #in~n; 79004#L25 assume ~n <= 0;#res := 1; 79003#factFINAL assume true; 78998#factEXIT >#66#return; 78996#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78993#factFINAL assume true; 78987#factEXIT >#66#return; 78985#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78838#factFINAL assume true; 78857#factEXIT >#68#return; 78839#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 78929#$Ultimate##0 ~n := #in~n; 78926#L25 assume !(~n <= 0); 78897#L26 call #t~ret0 := fact(~n - 1);< 78900#$Ultimate##0 ~n := #in~n; 78895#L25 assume ~n <= 0;#res := 1; 78899#factFINAL assume true; 78971#factEXIT >#66#return; 78969#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78968#factFINAL assume true; 78954#factEXIT >#70#return; 78725#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 78858#$Ultimate##0 ~n := #in~n; 78951#L25 assume !(~n <= 0); 78871#L26 call #t~ret0 := fact(~n - 1);< 78902#$Ultimate##0 ~n := #in~n; 78893#L25 assume !(~n <= 0); 78877#L26 call #t~ret0 := fact(~n - 1);< 79001#$Ultimate##0 ~n := #in~n; 79004#L25 assume ~n <= 0;#res := 1; 79003#factFINAL assume true; 78998#factEXIT >#66#return; 78996#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78993#factFINAL assume true; 78987#factEXIT >#66#return; 78985#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78838#factFINAL assume true; 78857#factEXIT >#72#return; 78812#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 79479#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 79476#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 79465#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 79274#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 78789#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 78953#$Ultimate##0 ~n := #in~n; 78928#L25 assume !(~n <= 0); 78871#L26 call #t~ret0 := fact(~n - 1);< 78902#$Ultimate##0 ~n := #in~n; 78893#L25 assume !(~n <= 0); 78877#L26 call #t~ret0 := fact(~n - 1);< 79001#$Ultimate##0 ~n := #in~n; 79004#L25 assume ~n <= 0;#res := 1; 79003#factFINAL assume true; 78998#factEXIT >#66#return; 78996#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78993#factFINAL assume true; 78987#factEXIT >#66#return; 78985#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78838#factFINAL assume true; 78857#factEXIT >#68#return; 78846#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 78929#$Ultimate##0 ~n := #in~n; 78926#L25 assume !(~n <= 0); 78897#L26 call #t~ret0 := fact(~n - 1);< 78900#$Ultimate##0 ~n := #in~n; 78901#L25 assume !(~n <= 0); 78999#L26 call #t~ret0 := fact(~n - 1);< 79000#$Ultimate##0 ~n := #in~n; 79004#L25 assume ~n <= 0;#res := 1; 79003#factFINAL assume true; 78998#factEXIT >#66#return; 78996#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78993#factFINAL assume true; 78987#factEXIT >#66#return; 78985#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78838#factFINAL assume true; 78857#factEXIT >#70#return; 78755#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 78858#$Ultimate##0 ~n := #in~n; 78951#L25 assume ~n <= 0;#res := 1; 78927#factFINAL assume true; 78957#factEXIT >#72#return; 78961#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 79032#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 79008#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 79009#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 78978#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 78733#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 78953#$Ultimate##0 ~n := #in~n; 78928#L25 assume !(~n <= 0); 78871#L26 call #t~ret0 := fact(~n - 1);< 78902#$Ultimate##0 ~n := #in~n; 78893#L25 assume !(~n <= 0); 78877#L26 call #t~ret0 := fact(~n - 1);< 79001#$Ultimate##0 ~n := #in~n; 78893#L25 assume !(~n <= 0); 78877#L26 call #t~ret0 := fact(~n - 1);< 79001#$Ultimate##0 ~n := #in~n; 79004#L25 assume ~n <= 0;#res := 1; 79003#factFINAL assume true; 78998#factEXIT >#66#return; 78996#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78993#factFINAL assume true; 78987#factEXIT >#66#return; 78990#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79331#factFINAL assume true; 78870#factEXIT >#66#return; 78883#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79359#factFINAL assume true; 78719#factEXIT >#74#return; 78816#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 78929#$Ultimate##0 ~n := #in~n; 78926#L25 assume !(~n <= 0); 78897#L26 call #t~ret0 := fact(~n - 1);< 78900#$Ultimate##0 ~n := #in~n; 78901#L25 assume !(~n <= 0); 78999#L26 call #t~ret0 := fact(~n - 1);< 79000#$Ultimate##0 ~n := #in~n; 79004#L25 assume ~n <= 0;#res := 1; 79003#factFINAL assume true; 78998#factEXIT >#66#return; 78996#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78993#factFINAL assume true; 78987#factEXIT >#66#return; 78985#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78838#factFINAL assume true; 78857#factEXIT >#76#return; 78743#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 78953#$Ultimate##0 ~n := #in~n; 78928#L25 assume !(~n <= 0); 78871#L26 call #t~ret0 := fact(~n - 1);< 78902#$Ultimate##0 ~n := #in~n; 78893#L25 assume !(~n <= 0); 78877#L26 call #t~ret0 := fact(~n - 1);< 79001#$Ultimate##0 ~n := #in~n; 79004#L25 assume ~n <= 0;#res := 1; 79003#factFINAL assume true; 78998#factEXIT >#66#return; 78996#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78993#factFINAL assume true; 78987#factEXIT >#66#return; 78985#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78838#factFINAL assume true; 78857#factEXIT >#78#return; 78820#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 79060#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 79031#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 78618#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 78619#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 78982#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 78977#L42-3 [2023-02-15 23:17:26,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:26,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 7 times [2023-02-15 23:17:26,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:26,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238516961] [2023-02-15 23:17:26,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:26,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:26,489 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:26,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1500606813] [2023-02-15 23:17:26,490 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 23:17:26,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:26,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:26,493 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:26,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Waiting until timeout for monitored process [2023-02-15 23:17:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:17:26,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:17:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:17:26,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:17:26,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:26,592 INFO L85 PathProgramCache]: Analyzing trace with hash -511059454, now seen corresponding path program 9 times [2023-02-15 23:17:26,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:26,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483390132] [2023-02-15 23:17:26,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:26,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:26,599 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:26,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818309463] [2023-02-15 23:17:26,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 23:17:26,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:26,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:26,605 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:26,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Waiting until timeout for monitored process [2023-02-15 23:17:26,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-15 23:17:26,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:17:26,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 23:17:26,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:17:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 278 proven. 3 refuted. 0 times theorem prover too weak. 2120 trivial. 0 not checked. [2023-02-15 23:17:26,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:17:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 278 proven. 4 refuted. 0 times theorem prover too weak. 2119 trivial. 0 not checked. [2023-02-15 23:17:27,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:17:27,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483390132] [2023-02-15 23:17:27,010 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:17:27,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818309463] [2023-02-15 23:17:27,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818309463] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:17:27,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:17:27,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2023-02-15 23:17:27,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218583116] [2023-02-15 23:17:27,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:17:27,011 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:17:27,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:17:27,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 23:17:27,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-15 23:17:27,011 INFO L87 Difference]: Start difference. First operand 2884 states and 5262 transitions. cyclomatic complexity: 2414 Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-02-15 23:17:27,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:17:27,154 INFO L93 Difference]: Finished difference Result 3050 states and 5472 transitions. [2023-02-15 23:17:27,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3050 states and 5472 transitions. [2023-02-15 23:17:27,177 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 539 [2023-02-15 23:17:27,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3050 states to 2928 states and 5236 transitions. [2023-02-15 23:17:27,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 969 [2023-02-15 23:17:27,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 969 [2023-02-15 23:17:27,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2928 states and 5236 transitions. [2023-02-15 23:17:27,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:17:27,207 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2928 states and 5236 transitions. [2023-02-15 23:17:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states and 5236 transitions. [2023-02-15 23:17:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2464. [2023-02-15 23:17:27,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2464 states, 1512 states have (on average 1.0740740740740742) internal successors, (1624), 1509 states have internal predecessors, (1624), 702 states have call successors, (732), 226 states have call predecessors, (732), 250 states have return successors, (1957), 728 states have call predecessors, (1957), 702 states have call successors, (1957) [2023-02-15 23:17:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 4313 transitions. [2023-02-15 23:17:27,283 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2464 states and 4313 transitions. [2023-02-15 23:17:27,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 23:17:27,283 INFO L428 stractBuchiCegarLoop]: Abstraction has 2464 states and 4313 transitions. [2023-02-15 23:17:27,284 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2023-02-15 23:17:27,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2464 states and 4313 transitions. [2023-02-15 23:17:27,294 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 369 [2023-02-15 23:17:27,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:17:27,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:17:27,295 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:27,296 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [29, 29, 17, 17, 17, 17, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:27,296 INFO L748 eck$LassoCheckResult]: Stem: 85769#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 85698#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 85699#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 85721#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 85708#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 85709#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 87506#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 85694#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85695#$Ultimate##0 ~n := #in~n; 87504#L25 assume ~n <= 0;#res := 1; 87503#factFINAL assume true; 87502#factEXIT >#68#return; 85757#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85758#$Ultimate##0 ~n := #in~n; 87528#L25 assume ~n <= 0;#res := 1; 87526#factFINAL assume true; 87524#factEXIT >#70#return; 85691#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85692#$Ultimate##0 ~n := #in~n; 87583#L25 assume ~n <= 0;#res := 1; 87582#factFINAL assume true; 87581#factEXIT >#72#return; 87580#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 85730#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 85731#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 87620#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 87618#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 87615#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 87616#$Ultimate##0 ~n := #in~n; 87627#L25 assume !(~n <= 0); 87584#L26 call #t~ret0 := fact(~n - 1);< 87626#$Ultimate##0 ~n := #in~n; 87629#L25 assume ~n <= 0;#res := 1; 87628#factFINAL assume true; 87625#factEXIT >#66#return; 87624#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87621#factFINAL assume true; 87614#factEXIT >#74#return; 87607#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 87609#$Ultimate##0 ~n := #in~n; 87623#L25 assume ~n <= 0;#res := 1; 87613#factFINAL assume true; 87606#factEXIT >#76#return; 87588#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 87604#$Ultimate##0 ~n := #in~n; 87622#L25 assume !(~n <= 0); 87611#L26 call #t~ret0 := fact(~n - 1);< 87612#$Ultimate##0 ~n := #in~n; 87619#L25 assume ~n <= 0;#res := 1; 87617#factFINAL assume true; 87610#factEXIT >#66#return; 87605#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87603#factFINAL assume true; 87587#factEXIT >#78#return; 87586#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 87585#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 87575#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86921#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 86920#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 86919#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 86118#L42-3 [2023-02-15 23:17:27,296 INFO L750 eck$LassoCheckResult]: Loop: 86118#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86093#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 85876#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85936#$Ultimate##0 ~n := #in~n; 86043#L25 assume !(~n <= 0); 85946#L26 call #t~ret0 := fact(~n - 1);< 85975#$Ultimate##0 ~n := #in~n; 85976#L25 assume !(~n <= 0); 85958#L26 call #t~ret0 := fact(~n - 1);< 86060#$Ultimate##0 ~n := #in~n; 86063#L25 assume ~n <= 0;#res := 1; 86062#factFINAL assume true; 86057#factEXIT >#66#return; 86059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86101#factFINAL assume true; 86097#factEXIT >#66#return; 86096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86094#factFINAL assume true; 86090#factEXIT >#68#return; 85877#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85936#$Ultimate##0 ~n := #in~n; 86043#L25 assume ~n <= 0;#res := 1; 85996#factFINAL assume true; 86083#factEXIT >#70#return; 86050#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86082#$Ultimate##0 ~n := #in~n; 86048#L25 assume !(~n <= 0); 85961#L26 call #t~ret0 := fact(~n - 1);< 86064#$Ultimate##0 ~n := #in~n; 85976#L25 assume !(~n <= 0); 85958#L26 call #t~ret0 := fact(~n - 1);< 86060#$Ultimate##0 ~n := #in~n; 85976#L25 assume !(~n <= 0); 85958#L26 call #t~ret0 := fact(~n - 1);< 86060#$Ultimate##0 ~n := #in~n; 85976#L25 assume !(~n <= 0); 85958#L26 call #t~ret0 := fact(~n - 1);< 86060#$Ultimate##0 ~n := #in~n; 86063#L25 assume ~n <= 0;#res := 1; 86062#factFINAL assume true; 86057#factEXIT >#66#return; 86059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86101#factFINAL assume true; 86097#factEXIT >#66#return; 86099#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86142#factFINAL assume true; 86053#factEXIT >#66#return; 85974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85955#factFINAL assume true; 85967#factEXIT >#66#return; 86140#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86136#factFINAL assume true; 86137#factEXIT >#72#return; 86092#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 86158#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 86157#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86155#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86154#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 85914#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86046#$Ultimate##0 ~n := #in~n; 85994#L25 assume !(~n <= 0); 85946#L26 call #t~ret0 := fact(~n - 1);< 85975#$Ultimate##0 ~n := #in~n; 85976#L25 assume !(~n <= 0); 85958#L26 call #t~ret0 := fact(~n - 1);< 86060#$Ultimate##0 ~n := #in~n; 86063#L25 assume ~n <= 0;#res := 1; 86062#factFINAL assume true; 86057#factEXIT >#66#return; 86059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86101#factFINAL assume true; 86097#factEXIT >#66#return; 86096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86094#factFINAL assume true; 86090#factEXIT >#68#return; 85871#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85997#$Ultimate##0 ~n := #in~n; 85995#L25 assume !(~n <= 0); 85944#L26 call #t~ret0 := fact(~n - 1);< 85977#$Ultimate##0 ~n := #in~n; 85972#L25 assume ~n <= 0;#res := 1; 85973#factFINAL assume true; 85940#factEXIT >#66#return; 85939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85933#factFINAL assume true; 85850#factEXIT >#70#return; 85897#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85936#$Ultimate##0 ~n := #in~n; 86043#L25 assume ~n <= 0;#res := 1; 85996#factFINAL assume true; 86083#factEXIT >#72#return; 85928#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 86153#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 86152#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86151#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86150#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 85874#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86046#$Ultimate##0 ~n := #in~n; 85994#L25 assume !(~n <= 0); 85946#L26 call #t~ret0 := fact(~n - 1);< 85975#$Ultimate##0 ~n := #in~n; 85976#L25 assume !(~n <= 0); 85958#L26 call #t~ret0 := fact(~n - 1);< 86060#$Ultimate##0 ~n := #in~n; 86063#L25 assume ~n <= 0;#res := 1; 86062#factFINAL assume true; 86057#factEXIT >#66#return; 86059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86101#factFINAL assume true; 86097#factEXIT >#66#return; 86096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86094#factFINAL assume true; 86090#factEXIT >#68#return; 85855#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85997#$Ultimate##0 ~n := #in~n; 85995#L25 assume !(~n <= 0); 85944#L26 call #t~ret0 := fact(~n - 1);< 85977#$Ultimate##0 ~n := #in~n; 85972#L25 assume ~n <= 0;#res := 1; 85973#factFINAL assume true; 85940#factEXIT >#66#return; 85939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85933#factFINAL assume true; 85850#factEXIT >#70#return; 85909#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85936#$Ultimate##0 ~n := #in~n; 86043#L25 assume ~n <= 0;#res := 1; 85996#factFINAL assume true; 86083#factEXIT >#72#return; 86089#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 86149#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 86148#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86146#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86143#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 85900#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86046#$Ultimate##0 ~n := #in~n; 85994#L25 assume !(~n <= 0); 85946#L26 call #t~ret0 := fact(~n - 1);< 85975#$Ultimate##0 ~n := #in~n; 85976#L25 assume !(~n <= 0); 85958#L26 call #t~ret0 := fact(~n - 1);< 86060#$Ultimate##0 ~n := #in~n; 85976#L25 assume !(~n <= 0); 85958#L26 call #t~ret0 := fact(~n - 1);< 86060#$Ultimate##0 ~n := #in~n; 86063#L25 assume ~n <= 0;#res := 1; 86062#factFINAL assume true; 86057#factEXIT >#66#return; 86059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86101#factFINAL assume true; 86097#factEXIT >#66#return; 86099#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86142#factFINAL assume true; 86053#factEXIT >#66#return; 86054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86138#factFINAL assume true; 86104#factEXIT >#74#return; 85864#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85997#$Ultimate##0 ~n := #in~n; 85995#L25 assume !(~n <= 0); 85944#L26 call #t~ret0 := fact(~n - 1);< 85977#$Ultimate##0 ~n := #in~n; 85972#L25 assume ~n <= 0;#res := 1; 85973#factFINAL assume true; 85940#factEXIT >#66#return; 85939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85933#factFINAL assume true; 85850#factEXIT >#76#return; 85885#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86046#$Ultimate##0 ~n := #in~n; 85994#L25 assume !(~n <= 0); 85946#L26 call #t~ret0 := fact(~n - 1);< 85975#$Ultimate##0 ~n := #in~n; 85972#L25 assume ~n <= 0;#res := 1; 85973#factFINAL assume true; 85940#factEXIT >#66#return; 85939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 85933#factFINAL assume true; 85850#factEXIT >#78#return; 85923#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 86111#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 86109#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86102#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 86103#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 86121#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 86118#L42-3 [2023-02-15 23:17:27,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 8 times [2023-02-15 23:17:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:27,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396434374] [2023-02-15 23:17:27,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:27,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:27,301 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:27,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825937826] [2023-02-15 23:17:27,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:17:27,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:27,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:27,313 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:27,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2023-02-15 23:17:27,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:17:27,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:17:27,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:17:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:17:27,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:17:27,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:27,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1801094726, now seen corresponding path program 10 times [2023-02-15 23:17:27,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:27,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494826322] [2023-02-15 23:17:27,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:27,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:27,422 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:27,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [473049366] [2023-02-15 23:17:27,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 23:17:27,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:27,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:27,426 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:27,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Waiting until timeout for monitored process [2023-02-15 23:17:27,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 23:17:27,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:17:27,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 23:17:27,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:17:27,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 1068 proven. 220 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2023-02-15 23:17:27,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:17:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 84 proven. 708 refuted. 0 times theorem prover too weak. 1141 trivial. 0 not checked. [2023-02-15 23:17:28,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:17:28,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494826322] [2023-02-15 23:17:28,347 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:17:28,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473049366] [2023-02-15 23:17:28,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473049366] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:17:28,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:17:28,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 27 [2023-02-15 23:17:28,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192181286] [2023-02-15 23:17:28,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:17:28,348 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:17:28,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:17:28,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 23:17:28,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2023-02-15 23:17:28,351 INFO L87 Difference]: Start difference. First operand 2464 states and 4313 transitions. cyclomatic complexity: 1882 Second operand has 27 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 25 states have internal predecessors, (67), 16 states have call successors, (32), 2 states have call predecessors, (32), 9 states have return successors, (35), 14 states have call predecessors, (35), 16 states have call successors, (35) [2023-02-15 23:17:29,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:17:29,295 INFO L93 Difference]: Finished difference Result 3492 states and 5844 transitions. [2023-02-15 23:17:29,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3492 states and 5844 transitions. [2023-02-15 23:17:29,315 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 599 [2023-02-15 23:17:29,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3492 states to 3492 states and 5844 transitions. [2023-02-15 23:17:29,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1171 [2023-02-15 23:17:29,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1171 [2023-02-15 23:17:29,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3492 states and 5844 transitions. [2023-02-15 23:17:29,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:17:29,346 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3492 states and 5844 transitions. [2023-02-15 23:17:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states and 5844 transitions. [2023-02-15 23:17:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 2771. [2023-02-15 23:17:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2771 states, 1713 states have (on average 1.0653823701109164) internal successors, (1825), 1702 states have internal predecessors, (1825), 808 states have call successors, (838), 234 states have call predecessors, (838), 250 states have return successors, (2160), 834 states have call predecessors, (2160), 808 states have call successors, (2160) [2023-02-15 23:17:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 4823 transitions. [2023-02-15 23:17:29,422 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2771 states and 4823 transitions. [2023-02-15 23:17:29,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 23:17:29,423 INFO L428 stractBuchiCegarLoop]: Abstraction has 2771 states and 4823 transitions. [2023-02-15 23:17:29,423 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2023-02-15 23:17:29,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2771 states and 4823 transitions. [2023-02-15 23:17:29,432 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 426 [2023-02-15 23:17:29,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:17:29,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:17:29,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:29,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [29, 29, 17, 17, 17, 17, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:29,434 INFO L748 eck$LassoCheckResult]: Stem: 92848#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 92788#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 92789#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 92810#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 92849#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 93605#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 93602#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 93596#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 93597#$Ultimate##0 ~n := #in~n; 93604#L25 assume ~n <= 0;#res := 1; 93601#factFINAL assume true; 93595#factEXIT >#68#return; 93592#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 93593#$Ultimate##0 ~n := #in~n; 93599#L25 assume ~n <= 0;#res := 1; 93594#factFINAL assume true; 93591#factEXIT >#70#return; 92770#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92771#$Ultimate##0 ~n := #in~n; 93779#L25 assume ~n <= 0;#res := 1; 93778#factFINAL assume true; 93777#factEXIT >#72#return; 93776#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 92819#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 92820#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 93847#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 93845#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 93842#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 93843#$Ultimate##0 ~n := #in~n; 93856#L25 assume !(~n <= 0); 93780#L26 call #t~ret0 := fact(~n - 1);< 93855#$Ultimate##0 ~n := #in~n; 93867#L25 assume ~n <= 0;#res := 1; 93865#factFINAL assume true; 93854#factEXIT >#66#return; 93852#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93848#factFINAL assume true; 93841#factEXIT >#74#return; 93822#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 93824#$Ultimate##0 ~n := #in~n; 93839#L25 assume ~n <= 0;#res := 1; 93837#factFINAL assume true; 93821#factEXIT >#76#return; 93785#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 93811#$Ultimate##0 ~n := #in~n; 93849#L25 assume !(~n <= 0); 93826#L26 call #t~ret0 := fact(~n - 1);< 93827#$Ultimate##0 ~n := #in~n; 93846#L25 assume ~n <= 0;#res := 1; 93844#factFINAL assume true; 93825#factEXIT >#66#return; 93812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93810#factFINAL assume true; 93784#factEXIT >#78#return; 93786#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 93752#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 93753#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 93427#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 93114#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 93417#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 93418#L42-3 [2023-02-15 23:17:29,434 INFO L750 eck$LassoCheckResult]: Loop: 93418#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94656#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 94331#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94404#$Ultimate##0 ~n := #in~n; 94588#L25 assume !(~n <= 0); 94434#L26 call #t~ret0 := fact(~n - 1);< 94503#$Ultimate##0 ~n := #in~n; 94504#L25 assume !(~n <= 0); 94452#L26 call #t~ret0 := fact(~n - 1);< 94601#$Ultimate##0 ~n := #in~n; 94603#L25 assume ~n <= 0;#res := 1; 94602#factFINAL assume true; 94597#factEXIT >#66#return; 94599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94655#factFINAL assume true; 94650#factEXIT >#66#return; 94649#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94647#factFINAL assume true; 94642#factEXIT >#68#return; 94626#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94641#$Ultimate##0 ~n := #in~n; 94646#L25 assume ~n <= 0;#res := 1; 94497#factFINAL assume true; 94624#factEXIT >#70#return; 94413#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94621#$Ultimate##0 ~n := #in~n; 94609#L25 assume !(~n <= 0); 94450#L26 call #t~ret0 := fact(~n - 1);< 94604#$Ultimate##0 ~n := #in~n; 94504#L25 assume !(~n <= 0); 94452#L26 call #t~ret0 := fact(~n - 1);< 94601#$Ultimate##0 ~n := #in~n; 94603#L25 assume ~n <= 0;#res := 1; 94602#factFINAL assume true; 94597#factEXIT >#66#return; 94599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94655#factFINAL assume true; 94650#factEXIT >#66#return; 94649#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94647#factFINAL assume true; 94642#factEXIT >#72#return; 94643#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 94742#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 94741#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94740#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94739#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 94355#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94591#$Ultimate##0 ~n := #in~n; 94538#L25 assume !(~n <= 0); 94434#L26 call #t~ret0 := fact(~n - 1);< 94503#$Ultimate##0 ~n := #in~n; 94504#L25 assume !(~n <= 0); 94452#L26 call #t~ret0 := fact(~n - 1);< 94601#$Ultimate##0 ~n := #in~n; 94603#L25 assume ~n <= 0;#res := 1; 94602#factFINAL assume true; 94597#factEXIT >#66#return; 94599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94655#factFINAL assume true; 94650#factEXIT >#66#return; 94649#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94647#factFINAL assume true; 94642#factEXIT >#68#return; 94345#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94498#$Ultimate##0 ~n := #in~n; 94496#L25 assume !(~n <= 0); 94433#L26 call #t~ret0 := fact(~n - 1);< 94439#$Ultimate##0 ~n := #in~n; 94499#L25 assume ~n <= 0;#res := 1; 94500#factFINAL assume true; 94429#factEXIT >#66#return; 94438#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94402#factFINAL assume true; 94316#factEXIT >#70#return; 94328#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94404#$Ultimate##0 ~n := #in~n; 94588#L25 assume ~n <= 0;#res := 1; 94497#factFINAL assume true; 94624#factEXIT >#72#return; 94384#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 94727#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 94723#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94718#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94710#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 94322#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94591#$Ultimate##0 ~n := #in~n; 94538#L25 assume !(~n <= 0); 94434#L26 call #t~ret0 := fact(~n - 1);< 94503#$Ultimate##0 ~n := #in~n; 94504#L25 assume !(~n <= 0); 94452#L26 call #t~ret0 := fact(~n - 1);< 94601#$Ultimate##0 ~n := #in~n; 94603#L25 assume ~n <= 0;#res := 1; 94602#factFINAL assume true; 94597#factEXIT >#66#return; 94599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94655#factFINAL assume true; 94650#factEXIT >#66#return; 94649#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94647#factFINAL assume true; 94642#factEXIT >#68#return; 94318#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94498#$Ultimate##0 ~n := #in~n; 94496#L25 assume !(~n <= 0); 94433#L26 call #t~ret0 := fact(~n - 1);< 94439#$Ultimate##0 ~n := #in~n; 94502#L25 assume !(~n <= 0); 94598#L26 call #t~ret0 := fact(~n - 1);< 94600#$Ultimate##0 ~n := #in~n; 94603#L25 assume ~n <= 0;#res := 1; 94602#factFINAL assume true; 94597#factEXIT >#66#return; 94599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94655#factFINAL assume true; 94650#factEXIT >#66#return; 94649#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94647#factFINAL assume true; 94642#factEXIT >#70#return; 94356#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94404#$Ultimate##0 ~n := #in~n; 94588#L25 assume ~n <= 0;#res := 1; 94497#factFINAL assume true; 94624#factEXIT >#72#return; 94637#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 94706#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 94705#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94704#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94701#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 94380#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94591#$Ultimate##0 ~n := #in~n; 94538#L25 assume !(~n <= 0); 94434#L26 call #t~ret0 := fact(~n - 1);< 94503#$Ultimate##0 ~n := #in~n; 94504#L25 assume !(~n <= 0); 94452#L26 call #t~ret0 := fact(~n - 1);< 94601#$Ultimate##0 ~n := #in~n; 94504#L25 assume !(~n <= 0); 94452#L26 call #t~ret0 := fact(~n - 1);< 94601#$Ultimate##0 ~n := #in~n; 94603#L25 assume ~n <= 0;#res := 1; 94602#factFINAL assume true; 94597#factEXIT >#66#return; 94599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94655#factFINAL assume true; 94650#factEXIT >#66#return; 94653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94707#factFINAL assume true; 94594#factEXIT >#66#return; 94407#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94428#factFINAL assume true; 94658#factEXIT >#74#return; 94335#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94498#$Ultimate##0 ~n := #in~n; 94496#L25 assume !(~n <= 0); 94433#L26 call #t~ret0 := fact(~n - 1);< 94439#$Ultimate##0 ~n := #in~n; 94502#L25 assume !(~n <= 0); 94598#L26 call #t~ret0 := fact(~n - 1);< 94600#$Ultimate##0 ~n := #in~n; 94603#L25 assume ~n <= 0;#res := 1; 94602#factFINAL assume true; 94597#factEXIT >#66#return; 94599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94655#factFINAL assume true; 94650#factEXIT >#66#return; 94649#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94647#factFINAL assume true; 94642#factEXIT >#76#return; 94321#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94591#$Ultimate##0 ~n := #in~n; 94538#L25 assume !(~n <= 0); 94434#L26 call #t~ret0 := fact(~n - 1);< 94503#$Ultimate##0 ~n := #in~n; 94499#L25 assume ~n <= 0;#res := 1; 94500#factFINAL assume true; 94429#factEXIT >#66#return; 94438#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94402#factFINAL assume true; 94316#factEXIT >#78#return; 94315#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 94313#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 94314#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94657#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 92806#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 92807#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 93418#L42-3 [2023-02-15 23:17:29,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:29,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 9 times [2023-02-15 23:17:29,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:29,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997788659] [2023-02-15 23:17:29,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:29,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:29,440 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:29,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560500013] [2023-02-15 23:17:29,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 23:17:29,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:29,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:29,445 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:29,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Waiting until timeout for monitored process [2023-02-15 23:17:29,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-02-15 23:17:29,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:17:29,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:17:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:17:29,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:17:29,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:29,554 INFO L85 PathProgramCache]: Analyzing trace with hash 111523274, now seen corresponding path program 11 times [2023-02-15 23:17:29,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:29,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328462376] [2023-02-15 23:17:29,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:29,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:29,563 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:29,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [441208490] [2023-02-15 23:17:29,563 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 23:17:29,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:29,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:29,569 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:29,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Waiting until timeout for monitored process [2023-02-15 23:17:29,666 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2023-02-15 23:17:29,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:17:29,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 23:17:29,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:17:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 1144 proven. 27 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2023-02-15 23:17:29,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:17:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 172 proven. 330 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2023-02-15 23:17:30,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:17:30,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328462376] [2023-02-15 23:17:30,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:17:30,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441208490] [2023-02-15 23:17:30,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441208490] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:17:30,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:17:30,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2023-02-15 23:17:30,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277677390] [2023-02-15 23:17:30,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:17:30,087 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:17:30,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:17:30,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 23:17:30,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-02-15 23:17:30,087 INFO L87 Difference]: Start difference. First operand 2771 states and 4823 transitions. cyclomatic complexity: 2085 Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 10 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (27), 8 states have call predecessors, (27), 10 states have call successors, (27) [2023-02-15 23:17:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:17:30,377 INFO L93 Difference]: Finished difference Result 3284 states and 5560 transitions. [2023-02-15 23:17:30,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3284 states and 5560 transitions. [2023-02-15 23:17:30,396 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 548 [2023-02-15 23:17:30,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3284 states to 3284 states and 5560 transitions. [2023-02-15 23:17:30,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1099 [2023-02-15 23:17:30,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1099 [2023-02-15 23:17:30,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3284 states and 5560 transitions. [2023-02-15 23:17:30,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:17:30,431 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3284 states and 5560 transitions. [2023-02-15 23:17:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states and 5560 transitions. [2023-02-15 23:17:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 2774. [2023-02-15 23:17:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2774 states, 1713 states have (on average 1.0653823701109164) internal successors, (1825), 1702 states have internal predecessors, (1825), 811 states have call successors, (841), 234 states have call predecessors, (841), 250 states have return successors, (2147), 837 states have call predecessors, (2147), 811 states have call successors, (2147) [2023-02-15 23:17:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 4813 transitions. [2023-02-15 23:17:30,506 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2774 states and 4813 transitions. [2023-02-15 23:17:30,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 23:17:30,507 INFO L428 stractBuchiCegarLoop]: Abstraction has 2774 states and 4813 transitions. [2023-02-15 23:17:30,507 INFO L335 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2023-02-15 23:17:30,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2774 states and 4813 transitions. [2023-02-15 23:17:30,517 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 417 [2023-02-15 23:17:30,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:17:30,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:17:30,519 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:30,519 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [31, 31, 19, 19, 19, 19, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:30,519 INFO L748 eck$LassoCheckResult]: Stem: 100180#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 100060#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 100061#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 100081#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 100181#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 100590#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102047#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 102045#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102046#$Ultimate##0 ~n := #in~n; 102066#L25 assume ~n <= 0;#res := 1; 102065#factFINAL assume true; 102044#factEXIT >#68#return; 100168#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100169#$Ultimate##0 ~n := #in~n; 102124#L25 assume ~n <= 0;#res := 1; 102122#factFINAL assume true; 102121#factEXIT >#70#return; 100033#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100034#$Ultimate##0 ~n := #in~n; 102231#L25 assume ~n <= 0;#res := 1; 102230#factFINAL assume true; 102229#factEXIT >#72#return; 102228#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 100089#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 100090#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 102319#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102315#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 102298#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102299#$Ultimate##0 ~n := #in~n; 102324#L25 assume !(~n <= 0); 102232#L26 call #t~ret0 := fact(~n - 1);< 102318#$Ultimate##0 ~n := #in~n; 102326#L25 assume ~n <= 0;#res := 1; 102323#factFINAL assume true; 102317#factEXIT >#66#return; 102314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102310#factFINAL assume true; 102297#factEXIT >#74#return; 102256#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 102257#$Ultimate##0 ~n := #in~n; 102296#L25 assume ~n <= 0;#res := 1; 102295#factFINAL assume true; 102255#factEXIT >#76#return; 102221#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 102246#$Ultimate##0 ~n := #in~n; 102268#L25 assume !(~n <= 0); 102265#L26 call #t~ret0 := fact(~n - 1);< 102266#$Ultimate##0 ~n := #in~n; 102274#L25 assume ~n <= 0;#res := 1; 102272#factFINAL assume true; 102264#factEXIT >#66#return; 102247#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102245#factFINAL assume true; 102220#factEXIT >#78#return; 102218#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 102216#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 102210#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 101227#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 100079#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 100080#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 100071#L42-3 [2023-02-15 23:17:30,519 INFO L750 eck$LassoCheckResult]: Loop: 100071#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100492#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 100282#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100354#$Ultimate##0 ~n := #in~n; 100490#L25 assume !(~n <= 0); 100360#L26 call #t~ret0 := fact(~n - 1);< 100405#$Ultimate##0 ~n := #in~n; 100406#L25 assume !(~n <= 0); 100390#L26 call #t~ret0 := fact(~n - 1);< 100448#$Ultimate##0 ~n := #in~n; 100455#L25 assume ~n <= 0;#res := 1; 100450#factFINAL assume true; 100444#factEXIT >#66#return; 100446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100500#factFINAL assume true; 100496#factEXIT >#66#return; 100495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100493#factFINAL assume true; 100486#factEXIT >#68#return; 100471#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100485#$Ultimate##0 ~n := #in~n; 100491#L25 assume ~n <= 0;#res := 1; 100411#factFINAL assume true; 100467#factEXIT >#70#return; 100452#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100458#$Ultimate##0 ~n := #in~n; 100456#L25 assume !(~n <= 0); 100388#L26 call #t~ret0 := fact(~n - 1);< 100449#$Ultimate##0 ~n := #in~n; 100406#L25 assume !(~n <= 0); 100390#L26 call #t~ret0 := fact(~n - 1);< 100448#$Ultimate##0 ~n := #in~n; 100455#L25 assume ~n <= 0;#res := 1; 100450#factFINAL assume true; 100444#factEXIT >#66#return; 100446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100500#factFINAL assume true; 100496#factEXIT >#66#return; 100495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100493#factFINAL assume true; 100486#factEXIT >#72#return; 100487#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 100758#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 100757#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100756#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100755#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 100277#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100350#$Ultimate##0 ~n := #in~n; 100409#L25 assume !(~n <= 0); 100360#L26 call #t~ret0 := fact(~n - 1);< 100405#$Ultimate##0 ~n := #in~n; 100406#L25 assume !(~n <= 0); 100390#L26 call #t~ret0 := fact(~n - 1);< 100448#$Ultimate##0 ~n := #in~n; 100455#L25 assume ~n <= 0;#res := 1; 100450#factFINAL assume true; 100444#factEXIT >#66#return; 100446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100500#factFINAL assume true; 100496#factEXIT >#66#return; 100495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100493#factFINAL assume true; 100486#factEXIT >#68#return; 100328#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100412#$Ultimate##0 ~n := #in~n; 100410#L25 assume !(~n <= 0); 100363#L26 call #t~ret0 := fact(~n - 1);< 100407#$Ultimate##0 ~n := #in~n; 100402#L25 assume ~n <= 0;#res := 1; 100403#factFINAL assume true; 100358#factEXIT >#66#return; 100357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100351#factFINAL assume true; 100268#factEXIT >#70#return; 100275#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100350#$Ultimate##0 ~n := #in~n; 100409#L25 assume !(~n <= 0); 100360#L26 call #t~ret0 := fact(~n - 1);< 100405#$Ultimate##0 ~n := #in~n; 100406#L25 assume !(~n <= 0); 100390#L26 call #t~ret0 := fact(~n - 1);< 100448#$Ultimate##0 ~n := #in~n; 100455#L25 assume ~n <= 0;#res := 1; 100450#factFINAL assume true; 100444#factEXIT >#66#return; 100446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100500#factFINAL assume true; 100496#factEXIT >#66#return; 100495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100493#factFINAL assume true; 100486#factEXIT >#72#return; 100339#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 100746#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 100745#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100744#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100743#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 100290#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100350#$Ultimate##0 ~n := #in~n; 100409#L25 assume !(~n <= 0); 100360#L26 call #t~ret0 := fact(~n - 1);< 100405#$Ultimate##0 ~n := #in~n; 100406#L25 assume !(~n <= 0); 100390#L26 call #t~ret0 := fact(~n - 1);< 100448#$Ultimate##0 ~n := #in~n; 100455#L25 assume ~n <= 0;#res := 1; 100450#factFINAL assume true; 100444#factEXIT >#66#return; 100446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100500#factFINAL assume true; 100496#factEXIT >#66#return; 100495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100493#factFINAL assume true; 100486#factEXIT >#68#return; 100276#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100412#$Ultimate##0 ~n := #in~n; 100410#L25 assume !(~n <= 0); 100363#L26 call #t~ret0 := fact(~n - 1);< 100407#$Ultimate##0 ~n := #in~n; 100408#L25 assume !(~n <= 0); 100445#L26 call #t~ret0 := fact(~n - 1);< 100447#$Ultimate##0 ~n := #in~n; 100455#L25 assume ~n <= 0;#res := 1; 100450#factFINAL assume true; 100444#factEXIT >#66#return; 100446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100500#factFINAL assume true; 100496#factEXIT >#66#return; 100495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100493#factFINAL assume true; 100486#factEXIT >#70#return; 100309#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100354#$Ultimate##0 ~n := #in~n; 100490#L25 assume ~n <= 0;#res := 1; 100411#factFINAL assume true; 100467#factEXIT >#72#return; 100481#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 100734#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 100732#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100730#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100710#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 100293#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100350#$Ultimate##0 ~n := #in~n; 100409#L25 assume !(~n <= 0); 100360#L26 call #t~ret0 := fact(~n - 1);< 100405#$Ultimate##0 ~n := #in~n; 100406#L25 assume !(~n <= 0); 100390#L26 call #t~ret0 := fact(~n - 1);< 100448#$Ultimate##0 ~n := #in~n; 100406#L25 assume !(~n <= 0); 100390#L26 call #t~ret0 := fact(~n - 1);< 100448#$Ultimate##0 ~n := #in~n; 100455#L25 assume ~n <= 0;#res := 1; 100450#factFINAL assume true; 100444#factEXIT >#66#return; 100446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100500#factFINAL assume true; 100496#factEXIT >#66#return; 100404#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100385#factFINAL assume true; 100394#factEXIT >#66#return; 100440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100703#factFINAL assume true; 100678#factEXIT >#74#return; 100314#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100412#$Ultimate##0 ~n := #in~n; 100410#L25 assume !(~n <= 0); 100363#L26 call #t~ret0 := fact(~n - 1);< 100407#$Ultimate##0 ~n := #in~n; 100408#L25 assume !(~n <= 0); 100445#L26 call #t~ret0 := fact(~n - 1);< 100447#$Ultimate##0 ~n := #in~n; 100455#L25 assume ~n <= 0;#res := 1; 100450#factFINAL assume true; 100444#factEXIT >#66#return; 100446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100500#factFINAL assume true; 100496#factEXIT >#66#return; 100495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100493#factFINAL assume true; 100486#factEXIT >#76#return; 100310#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100350#$Ultimate##0 ~n := #in~n; 100409#L25 assume !(~n <= 0); 100360#L26 call #t~ret0 := fact(~n - 1);< 100405#$Ultimate##0 ~n := #in~n; 100402#L25 assume ~n <= 0;#res := 1; 100403#factFINAL assume true; 100358#factEXIT >#66#return; 100357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100351#factFINAL assume true; 100268#factEXIT >#78#return; 100267#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 100265#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 100266#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100501#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 100078#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 100070#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 100071#L42-3 [2023-02-15 23:17:30,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:30,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 10 times [2023-02-15 23:17:30,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:30,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38812252] [2023-02-15 23:17:30,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:30,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:30,531 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:30,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438862647] [2023-02-15 23:17:30,531 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 23:17:30,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:30,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:30,535 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:30,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (181)] Waiting until timeout for monitored process [2023-02-15 23:17:30,612 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 23:17:30,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:17:30,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:17:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:17:30,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:17:30,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:30,640 INFO L85 PathProgramCache]: Analyzing trace with hash 547008906, now seen corresponding path program 12 times [2023-02-15 23:17:30,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:30,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952272043] [2023-02-15 23:17:30,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:30,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:30,647 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:30,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2147340011] [2023-02-15 23:17:30,648 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 23:17:30,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:30,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:30,651 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:30,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (182)] Waiting until timeout for monitored process [2023-02-15 23:17:30,776 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2023-02-15 23:17:30,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:17:30,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 23:17:30,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:17:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2239 backedges. 130 proven. 151 refuted. 0 times theorem prover too weak. 1958 trivial. 0 not checked. [2023-02-15 23:17:30,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:17:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2239 backedges. 130 proven. 152 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2023-02-15 23:17:31,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:17:31,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952272043] [2023-02-15 23:17:31,218 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:17:31,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147340011] [2023-02-15 23:17:31,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147340011] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:17:31,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:17:31,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 14 [2023-02-15 23:17:31,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752421906] [2023-02-15 23:17:31,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:17:31,219 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:17:31,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:17:31,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 23:17:31,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-02-15 23:17:31,219 INFO L87 Difference]: Start difference. First operand 2774 states and 4813 transitions. cyclomatic complexity: 2072 Second operand has 15 states, 12 states have (on average 3.25) internal successors, (39), 15 states have internal predecessors, (39), 8 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2023-02-15 23:17:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:17:31,503 INFO L93 Difference]: Finished difference Result 3425 states and 6120 transitions. [2023-02-15 23:17:31,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3425 states and 6120 transitions. [2023-02-15 23:17:31,520 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 589 [2023-02-15 23:17:31,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3425 states to 3425 states and 6120 transitions. [2023-02-15 23:17:31,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2023-02-15 23:17:31,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2023-02-15 23:17:31,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3425 states and 6120 transitions. [2023-02-15 23:17:31,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:17:31,553 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3425 states and 6120 transitions. [2023-02-15 23:17:31,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states and 6120 transitions. [2023-02-15 23:17:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 2915. [2023-02-15 23:17:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2915 states, 1808 states have (on average 1.0619469026548674) internal successors, (1920), 1797 states have internal predecessors, (1920), 857 states have call successors, (887), 234 states have call predecessors, (887), 250 states have return successors, (2324), 883 states have call predecessors, (2324), 857 states have call successors, (2324) [2023-02-15 23:17:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 5131 transitions. [2023-02-15 23:17:31,633 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2915 states and 5131 transitions. [2023-02-15 23:17:31,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 23:17:31,634 INFO L428 stractBuchiCegarLoop]: Abstraction has 2915 states and 5131 transitions. [2023-02-15 23:17:31,634 INFO L335 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2023-02-15 23:17:31,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2915 states and 5131 transitions. [2023-02-15 23:17:31,644 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 476 [2023-02-15 23:17:31,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:17:31,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:17:31,645 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:31,645 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 18, 18, 18, 18, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:17:31,645 INFO L748 eck$LassoCheckResult]: Stem: 107563#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 107507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 107508#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 107530#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 107518#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 107520#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 109590#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 109588#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 109589#$Ultimate##0 ~n := #in~n; 109592#L25 assume ~n <= 0;#res := 1; 109591#factFINAL assume true; 109587#factEXIT >#68#return; 107551#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 107552#$Ultimate##0 ~n := #in~n; 109691#L25 assume ~n <= 0;#res := 1; 109689#factFINAL assume true; 109685#factEXIT >#70#return; 107364#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107365#$Ultimate##0 ~n := #in~n; 109811#L25 assume ~n <= 0;#res := 1; 109809#factFINAL assume true; 109807#factEXIT >#72#return; 107525#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 107526#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 107538#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 109863#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 109860#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 109791#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 109792#$Ultimate##0 ~n := #in~n; 109866#L25 assume !(~n <= 0); 109812#L26 call #t~ret0 := fact(~n - 1);< 109865#$Ultimate##0 ~n := #in~n; 109868#L25 assume ~n <= 0;#res := 1; 109867#factFINAL assume true; 109864#factEXIT >#66#return; 109861#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109793#factFINAL assume true; 109790#factEXIT >#74#return; 109787#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 109788#$Ultimate##0 ~n := #in~n; 109857#L25 assume ~n <= 0;#res := 1; 109856#factFINAL assume true; 109786#factEXIT >#76#return; 109722#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 109785#$Ultimate##0 ~n := #in~n; 109850#L25 assume !(~n <= 0); 109847#L26 call #t~ret0 := fact(~n - 1);< 109848#$Ultimate##0 ~n := #in~n; 109859#L25 assume ~n <= 0;#res := 1; 109858#factFINAL assume true; 109846#factEXIT >#66#return; 109845#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109784#factFINAL assume true; 109721#factEXIT >#78#return; 109720#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 109717#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 109718#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 108864#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 107907#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 107908#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 107889#L42-3 [2023-02-15 23:17:31,646 INFO L750 eck$LassoCheckResult]: Loop: 107889#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107887#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 107676#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 107875#$Ultimate##0 ~n := #in~n; 107886#L25 assume !(~n <= 0); 107790#L26 call #t~ret0 := fact(~n - 1);< 107820#$Ultimate##0 ~n := #in~n; 107832#L25 assume !(~n <= 0); 107805#L26 call #t~ret0 := fact(~n - 1);< 107829#$Ultimate##0 ~n := #in~n; 107833#L25 assume ~n <= 0;#res := 1; 107831#factFINAL assume true; 107826#factEXIT >#66#return; 107828#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107902#factFINAL assume true; 107894#factEXIT >#66#return; 107891#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107888#factFINAL assume true; 107877#factEXIT >#68#return; 107861#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 107876#$Ultimate##0 ~n := #in~n; 107885#L25 assume ~n <= 0;#res := 1; 107822#factFINAL assume true; 107858#factEXIT >#70#return; 107760#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107837#$Ultimate##0 ~n := #in~n; 107836#L25 assume !(~n <= 0); 107806#L26 call #t~ret0 := fact(~n - 1);< 107835#$Ultimate##0 ~n := #in~n; 107832#L25 assume !(~n <= 0); 107805#L26 call #t~ret0 := fact(~n - 1);< 107829#$Ultimate##0 ~n := #in~n; 107833#L25 assume ~n <= 0;#res := 1; 107831#factFINAL assume true; 107826#factEXIT >#66#return; 107828#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107902#factFINAL assume true; 107894#factEXIT >#66#return; 107891#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107888#factFINAL assume true; 107877#factEXIT >#72#return; 107882#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 107983#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 107982#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107981#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107980#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 107722#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 107884#$Ultimate##0 ~n := #in~n; 107857#L25 assume !(~n <= 0); 107790#L26 call #t~ret0 := fact(~n - 1);< 107820#$Ultimate##0 ~n := #in~n; 107832#L25 assume !(~n <= 0); 107805#L26 call #t~ret0 := fact(~n - 1);< 107829#$Ultimate##0 ~n := #in~n; 107833#L25 assume ~n <= 0;#res := 1; 107831#factFINAL assume true; 107826#factEXIT >#66#return; 107828#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107902#factFINAL assume true; 107894#factEXIT >#66#return; 107891#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107888#factFINAL assume true; 107877#factEXIT >#68#return; 107667#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 107780#$Ultimate##0 ~n := #in~n; 107821#L25 assume !(~n <= 0); 107794#L26 call #t~ret0 := fact(~n - 1);< 107818#$Ultimate##0 ~n := #in~n; 107815#L25 assume ~n <= 0;#res := 1; 107816#factFINAL assume true; 107789#factEXIT >#66#return; 107796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107918#factFINAL assume true; 107659#factEXIT >#70#return; 107686#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107884#$Ultimate##0 ~n := #in~n; 107857#L25 assume !(~n <= 0); 107790#L26 call #t~ret0 := fact(~n - 1);< 107820#$Ultimate##0 ~n := #in~n; 107815#L25 assume ~n <= 0;#res := 1; 107816#factFINAL assume true; 107789#factEXIT >#66#return; 107796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107918#factFINAL assume true; 107659#factEXIT >#72#return; 107744#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 107979#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 107978#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107977#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107975#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 107679#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 107884#$Ultimate##0 ~n := #in~n; 107857#L25 assume !(~n <= 0); 107790#L26 call #t~ret0 := fact(~n - 1);< 107820#$Ultimate##0 ~n := #in~n; 107832#L25 assume !(~n <= 0); 107805#L26 call #t~ret0 := fact(~n - 1);< 107829#$Ultimate##0 ~n := #in~n; 107833#L25 assume ~n <= 0;#res := 1; 107831#factFINAL assume true; 107826#factEXIT >#66#return; 107828#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107902#factFINAL assume true; 107894#factEXIT >#66#return; 107891#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107888#factFINAL assume true; 107877#factEXIT >#68#return; 107690#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 107780#$Ultimate##0 ~n := #in~n; 107821#L25 assume !(~n <= 0); 107794#L26 call #t~ret0 := fact(~n - 1);< 107818#$Ultimate##0 ~n := #in~n; 107819#L25 assume !(~n <= 0); 107827#L26 call #t~ret0 := fact(~n - 1);< 107830#$Ultimate##0 ~n := #in~n; 107833#L25 assume ~n <= 0;#res := 1; 107831#factFINAL assume true; 107826#factEXIT >#66#return; 107828#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107902#factFINAL assume true; 107894#factEXIT >#66#return; 107891#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107888#factFINAL assume true; 107877#factEXIT >#70#return; 107695#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107875#$Ultimate##0 ~n := #in~n; 107886#L25 assume ~n <= 0;#res := 1; 107822#factFINAL assume true; 107858#factEXIT >#72#return; 107871#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 107970#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 107967#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107910#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107911#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 107681#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 107884#$Ultimate##0 ~n := #in~n; 107857#L25 assume !(~n <= 0); 107790#L26 call #t~ret0 := fact(~n - 1);< 107820#$Ultimate##0 ~n := #in~n; 107832#L25 assume !(~n <= 0); 107805#L26 call #t~ret0 := fact(~n - 1);< 107829#$Ultimate##0 ~n := #in~n; 107832#L25 assume !(~n <= 0); 107805#L26 call #t~ret0 := fact(~n - 1);< 107829#$Ultimate##0 ~n := #in~n; 107833#L25 assume ~n <= 0;#res := 1; 107831#factFINAL assume true; 107826#factEXIT >#66#return; 107828#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107902#factFINAL assume true; 107894#factEXIT >#66#return; 107897#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107957#factFINAL assume true; 107954#factEXIT >#66#return; 107953#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107752#factFINAL assume true; 107778#factEXIT >#74#return; 107723#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 107780#$Ultimate##0 ~n := #in~n; 107821#L25 assume !(~n <= 0); 107794#L26 call #t~ret0 := fact(~n - 1);< 107818#$Ultimate##0 ~n := #in~n; 107819#L25 assume !(~n <= 0); 107827#L26 call #t~ret0 := fact(~n - 1);< 107830#$Ultimate##0 ~n := #in~n; 107833#L25 assume ~n <= 0;#res := 1; 107831#factFINAL assume true; 107826#factEXIT >#66#return; 107828#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107902#factFINAL assume true; 107894#factEXIT >#66#return; 107891#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107888#factFINAL assume true; 107877#factEXIT >#76#return; 107713#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107884#$Ultimate##0 ~n := #in~n; 107857#L25 assume !(~n <= 0); 107790#L26 call #t~ret0 := fact(~n - 1);< 107820#$Ultimate##0 ~n := #in~n; 107815#L25 assume ~n <= 0;#res := 1; 107816#factFINAL assume true; 107789#factEXIT >#66#return; 107796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107918#factFINAL assume true; 107659#factEXIT >#78#return; 107746#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 107919#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 107901#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107892#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 107893#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 107900#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 107889#L42-3 [2023-02-15 23:17:31,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:31,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 11 times [2023-02-15 23:17:31,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:31,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3919754] [2023-02-15 23:17:31,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:31,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:31,651 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:31,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1290400827] [2023-02-15 23:17:31,651 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 23:17:31,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:31,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:31,695 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:31,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (183)] Waiting until timeout for monitored process [2023-02-15 23:17:31,774 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-02-15 23:17:31,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:17:31,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:17:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:17:31,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:17:31,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:31,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1676318190, now seen corresponding path program 13 times [2023-02-15 23:17:31,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:31,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947560533] [2023-02-15 23:17:31,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:31,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:31,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:31,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1582134479] [2023-02-15 23:17:31,809 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 23:17:31,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:31,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:31,812 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:31,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (184)] Waiting until timeout for monitored process [2023-02-15 23:17:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:17:32,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:17:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:17:32,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:17:32,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:17:32,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1124751758, now seen corresponding path program 12 times [2023-02-15 23:17:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:17:32,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163988607] [2023-02-15 23:17:32,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:17:32,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:17:32,113 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:17:32,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528262856] [2023-02-15 23:17:32,113 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 23:17:32,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:17:32,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:17:32,125 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:17:32,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (185)] Waiting until timeout for monitored process [2023-02-15 23:17:32,259 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2023-02-15 23:17:32,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:17:32,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 23:17:32,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:17:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3289 backedges. 118 proven. 114 refuted. 0 times theorem prover too weak. 3057 trivial. 0 not checked. [2023-02-15 23:17:32,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:17:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3289 backedges. 93 proven. 139 refuted. 0 times theorem prover too weak. 3057 trivial. 0 not checked. [2023-02-15 23:17:32,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:17:32,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163988607] [2023-02-15 23:17:32,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:17:32,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528262856] [2023-02-15 23:17:32,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528262856] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:17:32,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:17:32,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2023-02-15 23:17:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955277176] [2023-02-15 23:17:32,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:18:23,948 WARN L233 SmtUtils]: Spent 50.19s on a formula simplification. DAG size of input: 252 DAG size of output: 227 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-02-15 23:18:24,848 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:18:24,848 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:18:24,848 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:18:24,848 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:18:24,849 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:18:24,849 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:24,849 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:18:24,849 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:18:24,849 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration27_Loop [2023-02-15 23:18:24,849 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:18:24,849 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:18:24,850 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:24,852 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:24,887 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:24,889 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:24,890 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:24,892 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:24,904 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:24,906 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:24,907 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:25,079 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:18:25,079 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:18:25,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:25,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:25,082 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) [2023-02-15 23:18:25,083 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 [2023-02-15 23:18:25,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:18:25,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:18:25,093 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:18:25,094 INFO L440 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: [] [2023-02-15 23:18:25,096 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 [2023-02-15 23:18:25,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:25,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:25,098 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:18:25,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2023-02-15 23:18:25,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:18:25,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:18:25,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Forceful destruction successful, exit code 0 [2023-02-15 23:18:25,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:25,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:25,111 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:18:25,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2023-02-15 23:18:25,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:18:25,114 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:18:25,122 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:18:25,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0 [2023-02-15 23:18:25,125 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:18:25,125 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:18:25,125 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:18:25,125 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:18:25,125 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:18:25,125 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:25,125 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:18:25,125 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:18:25,126 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration27_Loop [2023-02-15 23:18:25,126 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:18:25,126 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:18:25,126 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:25,193 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:25,196 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:25,197 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:25,199 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:25,224 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:25,230 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:25,232 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:25,233 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:25,413 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:18:25,414 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:18:25,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:25,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:25,415 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:18:25,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2023-02-15 23:18:25,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:18:25,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:18:25,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:18:25,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:18:25,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:18:25,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:18:25,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:18:25,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:18:25,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:18:25,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2023-02-15 23:18:25,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:25,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:25,431 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:18:25,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2023-02-15 23:18:25,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 [2023-02-15 23:18:25,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:18:25,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:18:25,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:18:25,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:18:25,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:18:25,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:18:25,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:18:25,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:18:25,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Forceful destruction successful, exit code 0 [2023-02-15 23:18:25,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:25,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:25,444 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:18:25,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2023-02-15 23:18:25,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:18:25,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:18:25,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:18:25,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:18:25,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:18:25,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:18:25,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:18:25,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:18:25,454 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:18:25,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Forceful destruction successful, exit code 0 [2023-02-15 23:18:25,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:25,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:25,457 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:18:25,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2023-02-15 23:18:25,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:18:25,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:18:25,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:18:25,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:18:25,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:18:25,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:18:25,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:18:25,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:18:25,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:18:25,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2023-02-15 23:18:25,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:25,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:25,472 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:18:25,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2023-02-15 23:18:25,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:18:25,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:18:25,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:18:25,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:18:25,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:18:25,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:18:25,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:18:25,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:18:25,485 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:18:25,488 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-15 23:18:25,488 INFO L444 ModelExtractionUtils]: 4 out of 8 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:18:25,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:25,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:25,491 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:18:25,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2023-02-15 23:18:25,493 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:18:25,493 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:18:25,493 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:18:25,493 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2023-02-15 23:18:25,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2023-02-15 23:18:25,497 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:18:25,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:18:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:18:25,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 23:18:25,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:18:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:18:25,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-15 23:18:25,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:18:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 67 proven. 284 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2023-02-15 23:18:26,420 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 13 loop predicates [2023-02-15 23:18:26,420 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2915 states and 5131 transitions. cyclomatic complexity: 2249 Second operand has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 8 states have call successors, (21), 2 states have call predecessors, (21), 5 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2023-02-15 23:18:27,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2023-02-15 23:18:27,080 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2915 states and 5131 transitions. cyclomatic complexity: 2249. Second operand has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 8 states have call successors, (21), 2 states have call predecessors, (21), 5 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) Result 10838 states and 18652 transitions. Complement of second has 68 states. [2023-02-15 23:18:27,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2023-02-15 23:18:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 8 states have call successors, (21), 2 states have call predecessors, (21), 5 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2023-02-15 23:18:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 137 transitions. [2023-02-15 23:18:27,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 137 transitions. Stem has 60 letters. Loop has 191 letters. [2023-02-15 23:18:27,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:18:27,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 137 transitions. Stem has 251 letters. Loop has 191 letters. [2023-02-15 23:18:27,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:18:27,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 137 transitions. Stem has 60 letters. Loop has 382 letters. [2023-02-15 23:18:27,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:18:27,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10838 states and 18652 transitions. [2023-02-15 23:18:27,170 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 224 [2023-02-15 23:18:27,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10838 states to 3860 states and 5996 transitions. [2023-02-15 23:18:27,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1190 [2023-02-15 23:18:27,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1193 [2023-02-15 23:18:27,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3860 states and 5996 transitions. [2023-02-15 23:18:27,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:18:27,206 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3860 states and 5996 transitions. [2023-02-15 23:18:27,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3860 states and 5996 transitions. [2023-02-15 23:18:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3860 to 3771. [2023-02-15 23:18:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3771 states, 2361 states have (on average 1.0372723422278696) internal successors, (2449), 2358 states have internal predecessors, (2449), 1046 states have call successors, (1076), 342 states have call predecessors, (1076), 364 states have return successors, (2294), 1070 states have call predecessors, (2294), 1046 states have call successors, (2294) [2023-02-15 23:18:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 5819 transitions. [2023-02-15 23:18:27,285 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3771 states and 5819 transitions. [2023-02-15 23:18:27,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:18:27,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 23:18:27,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-02-15 23:18:27,286 INFO L87 Difference]: Start difference. First operand 3771 states and 5819 transitions. Second operand has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 15 states have internal predecessors, (56), 9 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2023-02-15 23:18:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:18:27,672 INFO L93 Difference]: Finished difference Result 5910 states and 9355 transitions. [2023-02-15 23:18:27,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5910 states and 9355 transitions. [2023-02-15 23:18:27,705 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 368 [2023-02-15 23:18:27,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5910 states to 4845 states and 7718 transitions. [2023-02-15 23:18:27,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1739 [2023-02-15 23:18:27,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1739 [2023-02-15 23:18:27,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4845 states and 7718 transitions. [2023-02-15 23:18:27,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:18:27,756 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4845 states and 7718 transitions. [2023-02-15 23:18:27,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4845 states and 7718 transitions. [2023-02-15 23:18:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4845 to 4031. [2023-02-15 23:18:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4031 states, 2506 states have (on average 1.036711891460495) internal successors, (2598), 2504 states have internal predecessors, (2598), 1161 states have call successors, (1191), 342 states have call predecessors, (1191), 364 states have return successors, (2533), 1184 states have call predecessors, (2533), 1161 states have call successors, (2533) [2023-02-15 23:18:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 6322 transitions. [2023-02-15 23:18:27,899 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4031 states and 6322 transitions. [2023-02-15 23:18:27,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 23:18:27,899 INFO L428 stractBuchiCegarLoop]: Abstraction has 4031 states and 6322 transitions. [2023-02-15 23:18:27,900 INFO L335 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2023-02-15 23:18:27,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4031 states and 6322 transitions. [2023-02-15 23:18:27,914 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 349 [2023-02-15 23:18:27,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:18:27,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:18:27,915 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [17, 17, 10, 7, 7, 7, 7, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:18:27,915 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:18:27,915 INFO L748 eck$LassoCheckResult]: Stem: 133307#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 133220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 133221#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 133261#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 133248#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 133250#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 134094#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 134092#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 134093#$Ultimate##0 ~n := #in~n; 134098#L25 assume ~n <= 0;#res := 1; 134097#factFINAL assume true; 134091#factEXIT >#68#return; 134088#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 134089#$Ultimate##0 ~n := #in~n; 134101#L25 assume ~n <= 0;#res := 1; 134100#factFINAL assume true; 134087#factEXIT >#70#return; 134068#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 134069#$Ultimate##0 ~n := #in~n; 134090#L25 assume ~n <= 0;#res := 1; 134082#factFINAL assume true; 134067#factEXIT >#72#return; 134065#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 134061#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 134059#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 134057#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 134056#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 134054#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 134055#$Ultimate##0 ~n := #in~n; 134066#L25 assume !(~n <= 0); 134063#L26 call #t~ret0 := fact(~n - 1);< 134064#$Ultimate##0 ~n := #in~n; 134086#L25 assume ~n <= 0;#res := 1; 134081#factFINAL assume true; 134062#factEXIT >#66#return; 134060#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134058#factFINAL assume true; 134053#factEXIT >#74#return; 134050#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 134051#$Ultimate##0 ~n := #in~n; 134071#L25 assume ~n <= 0;#res := 1; 134070#factFINAL assume true; 134049#factEXIT >#76#return; 134045#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 134046#$Ultimate##0 ~n := #in~n; 134099#L25 assume !(~n <= 0); 134084#L26 call #t~ret0 := fact(~n - 1);< 134085#$Ultimate##0 ~n := #in~n; 134096#L25 assume ~n <= 0;#res := 1; 134095#factFINAL assume true; 134083#factEXIT >#66#return; 134080#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134048#factFINAL assume true; 134044#factEXIT >#78#return; 134041#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 134038#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 134022#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133627#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 133626#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133623#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 133624#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136500#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 136293#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 136339#$Ultimate##0 ~n := #in~n; 136441#L25 assume ~n <= 0;#res := 1; 136438#factFINAL assume true; 136408#factEXIT >#68#return; 136434#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 136765#$Ultimate##0 ~n := #in~n; 136763#L25 assume ~n <= 0;#res := 1; 136761#factFINAL assume true; 136726#factEXIT >#70#return; 136744#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 136760#$Ultimate##0 ~n := #in~n; 136764#L25 assume !(~n <= 0); 136118#L26 call #t~ret0 := fact(~n - 1);< 136210#$Ultimate##0 ~n := #in~n; 136115#L25 assume !(~n <= 0); 136129#L26 call #t~ret0 := fact(~n - 1);< 136221#$Ultimate##0 ~n := #in~n; 136115#L25 assume !(~n <= 0); 136129#L26 call #t~ret0 := fact(~n - 1);< 136221#$Ultimate##0 ~n := #in~n; 136234#L25 assume ~n <= 0;#res := 1; 136232#factFINAL assume true; 136220#factEXIT >#66#return; 136219#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136170#factFINAL assume true; 136171#factEXIT >#66#return; 136180#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136181#factFINAL assume true; 136136#factEXIT >#66#return; 136139#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136851#factFINAL assume true; 136784#factEXIT >#72#return; 136800#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 136841#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 136838#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 136835#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136832#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 136771#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 136782#$Ultimate##0 ~n := #in~n; 136783#L25 assume !(~n <= 0); 136118#L26 call #t~ret0 := fact(~n - 1);< 136210#$Ultimate##0 ~n := #in~n; 136115#L25 assume !(~n <= 0); 136129#L26 call #t~ret0 := fact(~n - 1);< 136221#$Ultimate##0 ~n := #in~n; 136234#L25 assume ~n <= 0;#res := 1; 136232#factFINAL assume true; 136220#factEXIT >#66#return; 136219#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136170#factFINAL assume true; 136171#factEXIT >#66#return; 136196#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136781#factFINAL assume true; 136767#factEXIT >#68#return; 136731#L30-1 [2023-02-15 23:18:27,915 INFO L750 eck$LassoCheckResult]: Loop: 136731#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 136765#$Ultimate##0 ~n := #in~n; 136763#L25 assume ~n <= 0;#res := 1; 136761#factFINAL assume true; 136726#factEXIT >#70#return; 136506#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 136509#$Ultimate##0 ~n := #in~n; 136503#L25 assume !(~n <= 0); 136126#L26 call #t~ret0 := fact(~n - 1);< 136166#$Ultimate##0 ~n := #in~n; 136115#L25 assume !(~n <= 0); 136129#L26 call #t~ret0 := fact(~n - 1);< 136221#$Ultimate##0 ~n := #in~n; 136115#L25 assume !(~n <= 0); 136129#L26 call #t~ret0 := fact(~n - 1);< 136221#$Ultimate##0 ~n := #in~n; 136115#L25 assume !(~n <= 0); 136129#L26 call #t~ret0 := fact(~n - 1);< 136221#$Ultimate##0 ~n := #in~n; 136234#L25 assume ~n <= 0;#res := 1; 136232#factFINAL assume true; 136220#factEXIT >#66#return; 136219#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136170#factFINAL assume true; 136171#factEXIT >#66#return; 136180#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136181#factFINAL assume true; 136136#factEXIT >#66#return; 136143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136168#factFINAL assume true; 136169#factEXIT >#66#return; 136358#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136820#factFINAL assume true; 136815#factEXIT >#72#return; 136817#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 136849#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 136847#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 136845#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136843#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 136774#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 136782#$Ultimate##0 ~n := #in~n; 136783#L25 assume !(~n <= 0); 136118#L26 call #t~ret0 := fact(~n - 1);< 136210#$Ultimate##0 ~n := #in~n; 136115#L25 assume !(~n <= 0); 136129#L26 call #t~ret0 := fact(~n - 1);< 136221#$Ultimate##0 ~n := #in~n; 136234#L25 assume ~n <= 0;#res := 1; 136232#factFINAL assume true; 136220#factEXIT >#66#return; 136219#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136170#factFINAL assume true; 136171#factEXIT >#66#return; 136196#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136781#factFINAL assume true; 136767#factEXIT >#68#return; 136731#L30-1 [2023-02-15 23:18:27,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:18:27,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1415206922, now seen corresponding path program 13 times [2023-02-15 23:18:27,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:18:27,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492114142] [2023-02-15 23:18:27,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:18:27,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:18:27,921 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:18:27,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781638431] [2023-02-15 23:18:27,922 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 23:18:27,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:18:27,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:27,923 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:18:27,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (195)] Waiting until timeout for monitored process [2023-02-15 23:18:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:18:28,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 23:18:28,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:18:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 353 proven. 1 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2023-02-15 23:18:28,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:18:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 45 proven. 25 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2023-02-15 23:18:28,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:18:28,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492114142] [2023-02-15 23:18:28,195 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:18:28,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781638431] [2023-02-15 23:18:28,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781638431] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:18:28,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:18:28,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-02-15 23:18:28,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36777995] [2023-02-15 23:18:28,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:18:28,196 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:18:28,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:18:28,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1312281872, now seen corresponding path program 1 times [2023-02-15 23:18:28,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:18:28,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626436493] [2023-02-15 23:18:28,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:18:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:18:28,204 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:18:28,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [549295184] [2023-02-15 23:18:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:18:28,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:18:28,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:28,206 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:18:28,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (196)] Waiting until timeout for monitored process [2023-02-15 23:18:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:18:28,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:18:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:18:28,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:18:30,409 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:18:30,409 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:18:30,409 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:18:30,409 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:18:30,409 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:18:30,409 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:30,409 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:18:30,409 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:18:30,409 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration28_Loop [2023-02-15 23:18:30,410 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:18:30,410 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:18:30,410 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:30,430 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:30,432 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:30,433 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:30,434 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:30,435 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:30,504 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:18:30,504 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:18:30,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:30,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:30,506 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:18:30,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2023-02-15 23:18:30,509 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:18:30,509 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:18:30,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Forceful destruction successful, exit code 0 [2023-02-15 23:18:30,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:30,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:30,520 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:18:30,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2023-02-15 23:18:30,523 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:18:30,523 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:18:30,537 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:18:30,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2023-02-15 23:18:30,541 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:18:30,541 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:18:30,541 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:18:30,541 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:18:30,541 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:18:30,541 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:30,541 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:18:30,541 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:18:30,541 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration28_Loop [2023-02-15 23:18:30,541 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:18:30,541 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:18:30,542 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:30,544 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:30,545 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:30,565 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:30,566 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:30,568 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:18:30,643 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:18:30,643 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:18:30,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:30,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:30,645 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:18:30,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2023-02-15 23:18:30,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:18:30,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:18:30,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:18:30,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:18:30,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:18:30,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:18:30,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:18:30,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:18:30,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:18:30,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Forceful destruction successful, exit code 0 [2023-02-15 23:18:30,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:30,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:30,660 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:18:30,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2023-02-15 23:18:30,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:18:30,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:18:30,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:18:30,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:18:30,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:18:30,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:18:30,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:18:30,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:18:30,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:18:30,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2023-02-15 23:18:30,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:30,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:30,674 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:18:30,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2023-02-15 23:18:30,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:18:30,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:18:30,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:18:30,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:18:30,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:18:30,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:18:30,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:18:30,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:18:30,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:18:30,720 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:18:30,720 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 23:18:30,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:18:30,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:18:30,733 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:18:30,737 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:18:30,737 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:18:30,737 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:18:30,737 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~k~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2023-02-15 23:18:30,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2023-02-15 23:18:30,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Forceful destruction successful, exit code 0 [2023-02-15 23:18:30,742 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:18:30,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:18:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:18:30,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2023-02-15 23:18:30,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 23:18:30,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:18:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:18:31,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 23:18:31,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:18:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2023-02-15 23:18:31,549 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2023-02-15 23:18:31,549 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4031 states and 6322 transitions. cyclomatic complexity: 2346 Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-15 23:18:31,644 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4031 states and 6322 transitions. cyclomatic complexity: 2346. Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Result 5123 states and 7848 transitions. Complement of second has 16 states. [2023-02-15 23:18:31,645 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 [2023-02-15 23:18:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-15 23:18:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2023-02-15 23:18:31,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 117 letters. Loop has 56 letters. [2023-02-15 23:18:31,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:18:31,646 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:18:31,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:18:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:18:31,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 23:18:31,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:18:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:18:32,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 23:18:32,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:18:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2023-02-15 23:18:32,499 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2023-02-15 23:18:32,499 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4031 states and 6322 transitions. cyclomatic complexity: 2346 Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-15 23:18:32,600 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4031 states and 6322 transitions. cyclomatic complexity: 2346. Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Result 5123 states and 7848 transitions. Complement of second has 16 states. [2023-02-15 23:18:32,601 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 [2023-02-15 23:18:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-15 23:18:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2023-02-15 23:18:32,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 117 letters. Loop has 56 letters. [2023-02-15 23:18:32,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:18:32,602 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:18:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:18:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:18:32,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 23:18:32,710 INFO L286 TraceCheckSpWp]: Computing forward predicates...