./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 a31fd051 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-?-a31fd05 [2023-02-15 14:14:28,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 14:14:28,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 14:14:28,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 14:14:28,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 14:14:28,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 14:14:28,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 14:14:28,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 14:14:28,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 14:14:28,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 14:14:28,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 14:14:28,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 14:14:28,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 14:14:28,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 14:14:28,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 14:14:28,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 14:14:28,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 14:14:28,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 14:14:28,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 14:14:28,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 14:14:28,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 14:14:28,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 14:14:28,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 14:14:28,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 14:14:28,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 14:14:28,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 14:14:28,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 14:14:28,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 14:14:28,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 14:14:28,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 14:14:28,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 14:14:28,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 14:14:28,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 14:14:28,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 14:14:28,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 14:14:28,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 14:14:28,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 14:14:28,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 14:14:28,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 14:14:28,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 14:14:28,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 14:14:28,787 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-15 14:14:28,809 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 14:14:28,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 14:14:28,812 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 14:14:28,812 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 14:14:28,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 14:14:28,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 14:14:28,814 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 14:14:28,815 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-15 14:14:28,815 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-15 14:14:28,815 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-15 14:14:28,816 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-15 14:14:28,816 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-15 14:14:28,816 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-15 14:14:28,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 14:14:28,816 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 14:14:28,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 14:14:28,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 14:14:28,817 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-15 14:14:28,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-15 14:14:28,817 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-15 14:14:28,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 14:14:28,818 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-15 14:14:28,818 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 14:14:28,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-15 14:14:28,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 14:14:28,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 14:14:28,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 14:14:28,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 14:14:28,820 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-15 14:14:28,820 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 14:14:29,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 14:14:29,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 14:14:29,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 14:14:29,092 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 14:14:29,092 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 14:14:29,093 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 14:14:30,107 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 14:14:30,320 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 14:14:30,322 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2023-02-15 14:14:30,331 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a45f8c1a0/e4b3b1e5724c46cc95ac8c066d691f8f/FLAG89b806b2c [2023-02-15 14:14:30,348 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a45f8c1a0/e4b3b1e5724c46cc95ac8c066d691f8f [2023-02-15 14:14:30,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 14:14:30,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 14:14:30,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 14:14:30,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 14:14:30,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 14:14:30,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:14:30" (1/1) ... [2023-02-15 14:14:30,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4394d9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:30, skipping insertion in model container [2023-02-15 14:14:30,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:14:30" (1/1) ... [2023-02-15 14:14:30,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 14:14:30,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 14:14:30,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:14:30,498 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 14:14:30,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:14:30,518 INFO L208 MainTranslator]: Completed translation [2023-02-15 14:14:30,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:30 WrapperNode [2023-02-15 14:14:30,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 14:14:30,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 14:14:30,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 14:14:30,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 14:14:30,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:30" (1/1) ... [2023-02-15 14:14:30,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:30" (1/1) ... [2023-02-15 14:14:30,544 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2023-02-15 14:14:30,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 14:14:30,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 14:14:30,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 14:14:30,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 14:14:30,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:30" (1/1) ... [2023-02-15 14:14:30,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:30" (1/1) ... [2023-02-15 14:14:30,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:30" (1/1) ... [2023-02-15 14:14:30,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:30" (1/1) ... [2023-02-15 14:14:30,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:30" (1/1) ... [2023-02-15 14:14:30,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:30" (1/1) ... [2023-02-15 14:14:30,559 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:30" (1/1) ... [2023-02-15 14:14:30,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:30" (1/1) ... [2023-02-15 14:14:30,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 14:14:30,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 14:14:30,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 14:14:30,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 14:14:30,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:30" (1/1) ... [2023-02-15 14:14:30,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:30,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:30,589 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 14:14:30,592 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 14:14:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2023-02-15 14:14:30,617 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2023-02-15 14:14:30,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 14:14:30,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 14:14:30,659 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 14:14:30,660 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 14:14:30,772 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 14:14:30,778 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 14:14:30,778 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 14:14:30,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:14:30 BoogieIcfgContainer [2023-02-15 14:14:30,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 14:14:30,781 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-15 14:14:30,781 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-15 14:14:30,784 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-15 14:14:30,785 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:14:30,785 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.02 02:14:30" (1/3) ... [2023-02-15 14:14:30,786 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f889787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:14:30, skipping insertion in model container [2023-02-15 14:14:30,786 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:14:30,786 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:30" (2/3) ... [2023-02-15 14:14:30,786 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f889787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:14:30, skipping insertion in model container [2023-02-15 14:14:30,787 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:14:30,787 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:14:30" (3/3) ... [2023-02-15 14:14:30,788 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2023-02-15 14:14:30,827 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-15 14:14:30,827 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-15 14:14:30,827 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-15 14:14:30,827 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-15 14:14:30,827 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-15 14:14:30,828 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-15 14:14:30,828 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-15 14:14:30,828 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-15 14:14:30,831 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 14:14:30,848 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2023-02-15 14:14:30,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:30,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:30,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 14:14:30,852 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 14:14:30,853 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-15 14:14:30,853 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 14:14:30,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2023-02-15 14:14:30,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:30,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:30,857 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 14:14:30,857 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 14:14:30,864 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 14:14:30,864 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 14:14:30,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2023-02-15 14:14:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:30,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500432244] [2023-02-15 14:14:30,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:30,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:30,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:30,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:30,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:30,955 INFO L85 PathProgramCache]: Analyzing trace with hash 57812, now seen corresponding path program 1 times [2023-02-15 14:14:30,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:30,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453039845] [2023-02-15 14:14:30,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:30,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:30,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:30,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:30,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash 553673357, now seen corresponding path program 1 times [2023-02-15 14:14:30,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:30,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995149865] [2023-02-15 14:14:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:30,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:31,038 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 14:14:31,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:31,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995149865] [2023-02-15 14:14:31,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995149865] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:31,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:31,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 14:14:31,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614824556] [2023-02-15 14:14:31,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:31,082 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:31,083 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:31,083 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:31,083 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:31,083 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:14:31,083 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:31,083 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:31,084 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:31,084 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2023-02-15 14:14:31,084 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:31,084 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:31,096 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 14:14:31,107 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 14:14:31,153 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:31,153 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:14:31,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:31,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:31,159 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 14:14:31,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:31,165 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:31,175 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 14:14:31,193 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:31,193 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 14:14:31,199 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 14:14:31,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:31,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:31,200 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 14:14:31,202 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 14:14:31,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:31,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:31,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-02-15 14:14:31,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:31,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:31,224 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 14:14:31,226 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 14:14:31,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:14:31,227 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:31,351 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:14:31,357 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 14:14:31,358 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:31,358 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:31,358 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:31,358 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:31,358 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:31,358 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:31,358 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:31,359 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:31,359 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2023-02-15 14:14:31,359 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:31,359 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:31,360 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 14:14:31,368 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 14:14:31,419 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:31,422 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:31,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:31,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:31,429 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 14:14:31,430 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 14:14:31,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:31,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:31,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:31,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:31,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:31,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:31,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:31,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:31,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:31,455 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 14:14:31,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:31,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:31,457 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 14:14:31,458 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 14:14:31,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:31,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:31,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:31,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:31,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:31,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:31,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:31,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:31,475 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:31,481 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-15 14:14:31,481 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2023-02-15 14:14:31,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:31,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:31,486 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 14:14:31,488 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 14:14:31,489 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:31,489 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:14:31,489 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:31,490 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 14:14:31,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:31,496 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:14:31,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:31,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:14:31,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:31,551 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:14:31,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:31,625 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 14:14:31,674 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 14:14:31,683 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 14:14:31,685 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 14:14:31,751 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 14:14:31,752 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 14:14:31,756 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 14:14:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2023-02-15 14:14:31,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 3 letters. [2023-02-15 14:14:31,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:31,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 7 letters. Loop has 3 letters. [2023-02-15 14:14:31,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:31,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 6 letters. [2023-02-15 14:14:31,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:31,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 106 transitions. [2023-02-15 14:14:31,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2023-02-15 14:14:31,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 33 states and 48 transitions. [2023-02-15 14:14:31,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-02-15 14:14:31,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-02-15 14:14:31,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2023-02-15 14:14:31,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:31,772 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 48 transitions. [2023-02-15 14:14:31,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2023-02-15 14:14:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2023-02-15 14:14:31,793 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 14:14:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2023-02-15 14:14:31,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 42 transitions. [2023-02-15 14:14:31,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:31,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 14:14:31,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 14:14:31,798 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 14:14:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:31,849 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-02-15 14:14:31,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2023-02-15 14:14:31,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-15 14:14:31,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 37 transitions. [2023-02-15 14:14:31,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-02-15 14:14:31,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-02-15 14:14:31,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2023-02-15 14:14:31,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:14:31,855 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-02-15 14:14:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2023-02-15 14:14:31,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-02-15 14:14:31,858 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 14:14:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-02-15 14:14:31,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-02-15 14:14:31,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 14:14:31,860 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-02-15 14:14:31,860 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-15 14:14:31,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2023-02-15 14:14:31,861 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-15 14:14:31,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:31,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:31,862 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 14:14:31,862 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 14:14:31,863 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 14:14:31,863 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 14:14:31,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2023-02-15 14:14:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:31,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195105337] [2023-02-15 14:14:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:31,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:31,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:31,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:31,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:31,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1284911041, now seen corresponding path program 1 times [2023-02-15 14:14:31,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:31,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094830611] [2023-02-15 14:14:31,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:31,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:31,889 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:14:31,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [232607480] [2023-02-15 14:14:31,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:31,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:31,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:31,891 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 14:14:31,893 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 14:14:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:31,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:31,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:32,005 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 14:14:32,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 14:14:32,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:32,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094830611] [2023-02-15 14:14:32,006 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 14:14:32,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232607480] [2023-02-15 14:14:32,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232607480] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:32,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:32,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 14:14:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094437050] [2023-02-15 14:14:32,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:32,007 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:14:32,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 14:14:32,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 14:14:32,008 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 14:14:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:32,061 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2023-02-15 14:14:32,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2023-02-15 14:14:32,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2023-02-15 14:14:32,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2023-02-15 14:14:32,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-02-15 14:14:32,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-02-15 14:14:32,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2023-02-15 14:14:32,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:14:32,065 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2023-02-15 14:14:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2023-02-15 14:14:32,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2023-02-15 14:14:32,068 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 14:14:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2023-02-15 14:14:32,069 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2023-02-15 14:14:32,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 14:14:32,072 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2023-02-15 14:14:32,072 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-15 14:14:32,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2023-02-15 14:14:32,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-15 14:14:32,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:32,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:32,076 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 14:14:32,076 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 14:14:32,076 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 14:14:32,076 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 14:14:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:32,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2023-02-15 14:14:32,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:32,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787098127] [2023-02-15 14:14:32,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:32,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:32,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:32,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:32,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:32,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1183838151, now seen corresponding path program 1 times [2023-02-15 14:14:32,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:32,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406659230] [2023-02-15 14:14:32,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:32,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:32,118 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:14:32,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [599198055] [2023-02-15 14:14:32,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:32,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:32,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:32,127 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 14:14:32,128 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 14:14:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:32,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:32,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:32,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2107943858, now seen corresponding path program 1 times [2023-02-15 14:14:32,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:32,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949160664] [2023-02-15 14:14:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:32,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:32,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:32,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949160664] [2023-02-15 14:14:32,199 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 14:14:32,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016600361] [2023-02-15 14:14:32,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:32,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:32,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:32,207 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 14:14:32,224 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 14:14:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:32,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 14:14:32,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:32,269 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 14:14:32,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 14:14:32,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016600361] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:32,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:32,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 14:14:32,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459366204] [2023-02-15 14:14:32,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:32,591 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:32,592 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:32,592 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:32,592 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:32,592 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:14:32,592 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:32,592 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:32,592 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:32,592 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2023-02-15 14:14:32,592 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:32,592 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:32,594 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 14:14:32,596 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 14:14:32,621 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 14:14:32,624 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 14:14:32,625 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 14:14:32,627 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 14:14:32,629 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 14:14:32,836 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:32,836 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:14:32,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:32,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:32,841 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 14:14:32,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:32,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:32,856 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 14:14:32,865 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:32,865 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 14:14:32,876 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 14:14:32,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:32,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:32,878 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 14:14:32,881 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 14:14:32,882 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:32,883 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:32,920 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 14:14:32,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:32,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:32,922 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 14:14:32,925 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 14:14:32,926 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:14:32,926 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:32,964 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:14:32,971 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 14:14:32,971 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:32,972 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:32,972 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:32,972 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:32,972 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:32,972 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:32,972 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:32,972 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:32,972 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2023-02-15 14:14:32,972 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:32,972 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:32,973 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 14:14:32,976 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 14:14:32,978 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 14:14:32,980 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 14:14:32,982 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 14:14:32,983 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 14:14:32,985 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 14:14:33,192 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:33,192 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:33,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,197 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 14:14:33,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:33,207 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 14:14:33,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:33,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:33,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,220 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 14:14:33,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,221 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 14:14:33,222 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 14:14:33,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:33,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:33,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:33,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,238 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 14:14:33,239 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 14:14:33,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:33,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:33,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,266 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 14:14:33,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,267 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 14:14:33,270 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 14:14:33,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 14:14:33,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:33,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:33,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,289 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 14:14:33,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,290 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 14:14:33,292 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 14:14:33,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:33,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:33,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:33,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,307 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 14:14:33,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,308 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 14:14:33,310 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 14:14:33,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:33,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:33,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:33,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,344 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 14:14:33,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,346 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 14:14:33,350 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 14:14:33,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:33,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:33,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,396 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 14:14:33,398 INFO L490 LassoAnalysis]: Using template '2-nested'. [2023-02-15 14:14:33,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,400 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 14:14:33,400 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 14:14:33,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,409 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 14:14:33,410 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 14:14:33,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,444 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 14:14:33,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,445 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 14:14:33,447 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 14:14:33,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,455 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 14:14:33,456 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 14:14:33,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,478 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 14:14:33,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,479 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 14:14:33,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,493 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 14:14:33,500 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 14:14:33,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,501 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 14:14:33,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,523 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 14:14:33,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,524 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 14:14:33,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,539 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 14:14:33,539 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 14:14:33,540 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 14:14:33,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,563 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 14:14:33,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,565 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 14:14:33,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,582 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 14:14:33,583 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 14:14:33,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,585 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 14:14:33,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:33,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,608 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 14:14:33,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 14:14:33,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,622 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 14:14:33,622 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 14:14:33,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,624 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 14:14:33,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,640 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 14:14:33,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,642 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 14:14:33,644 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 14:14:33,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 14:14:33,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,655 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 14:14:33,659 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 14:14:33,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,683 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 14:14:33,683 INFO L490 LassoAnalysis]: Using template '3-nested'. [2023-02-15 14:14:33,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,685 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 14:14:33,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,697 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:33,698 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:33,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,700 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 14:14:33,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:33,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,718 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 14:14:33,720 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 14:14:33,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:33,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,730 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:33,730 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:33,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,753 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 14:14:33,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,754 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 14:14:33,757 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 14:14:33,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,766 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:33,767 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:33,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,787 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 14:14:33,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,788 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 14:14:33,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,801 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:33,802 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:33,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,804 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 14:14:33,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:33,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,833 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 14:14:33,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,845 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:33,846 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:33,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,848 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 14:14:33,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,865 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 14:14:33,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,867 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 14:14:33,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,881 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:33,882 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:33,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,884 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 14:14:33,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,907 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 14:14:33,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,910 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 14:14:33,912 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 14:14:33,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,923 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:33,929 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:33,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:33,957 INFO L490 LassoAnalysis]: Using template '4-nested'. [2023-02-15 14:14:33,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,958 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 14:14:33,960 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 14:14:33,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:33,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:33,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:33,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:33,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:33,970 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 14:14:33,971 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 14:14:33,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:33,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:33,990 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 14:14:33,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:33,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:33,992 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 14:14:33,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:34,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,005 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 14:14:34,006 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 14:14:34,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,008 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 14:14:34,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,018 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 14:14:34,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,019 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 14:14:34,020 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 14:14:34,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:34,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,030 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 14:14:34,031 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 14:14:34,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:34,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,047 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 14:14:34,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:34,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,061 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 14:14:34,062 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 14:14:34,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,064 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 14:14:34,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,086 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 14:14:34,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,088 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 14:14:34,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:34,096 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 14:14:34,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:34,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,100 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 14:14:34,100 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 14:14:34,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,116 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,132 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 14:14:34,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,134 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 14:14:34,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 14:14:34,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:34,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,154 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 14:14:34,155 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 14:14:34,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,157 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 14:14:34,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,175 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 14:14:34,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,176 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 14:14:34,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:34,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,192 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 14:14:34,198 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 14:14:34,203 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 14:14:34,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,224 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 14:14:34,225 INFO L490 LassoAnalysis]: Using template '2-phase'. [2023-02-15 14:14:34,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,226 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 14:14:34,231 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 14:14:34,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 14:14:34,239 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,239 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 14:14:34,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,239 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 14:14:34,240 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 14:14:34,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,257 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 14:14:34,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,259 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 14:14:34,261 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 14:14:34,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:34,270 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,270 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 14:14:34,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,271 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 14:14:34,271 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 14:14:34,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:34,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,290 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 14:14:34,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:34,309 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,309 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 14:14:34,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,310 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 14:14:34,311 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 14:14:34,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,313 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 14:14:34,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:34,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,333 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 14:14:34,335 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 14:14:34,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,343 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,343 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 14:14:34,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,343 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 14:14:34,344 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 14:14:34,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:34,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,353 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 14:14:34,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,364 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 14:14:34,364 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,365 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 14:14:34,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,365 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 14:14:34,365 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 14:14:34,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,375 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 14:14:34,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,376 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 14:14:34,377 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 14:14:34,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,386 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,387 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 14:14:34,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,387 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 14:14:34,388 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 14:14:34,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,419 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 14:14:34,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,420 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 14:14:34,424 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 14:14:34,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,467 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,468 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 14:14:34,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,468 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-15 14:14:34,473 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-15 14:14:34,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,490 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 14:14:34,490 INFO L490 LassoAnalysis]: Using template '3-phase'. [2023-02-15 14:14:34,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,491 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 14:14:34,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,505 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,505 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 14:14:34,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,506 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:34,507 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:34,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,510 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 14:14:34,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:34,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,530 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 14:14:34,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,541 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,541 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 14:14:34,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,542 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:34,543 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:34,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,546 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 14:14:34,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:34,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,562 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 14:14:34,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 14:14:34,577 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,577 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 14:14:34,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,578 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:34,579 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:34,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,582 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 14:14:34,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,608 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 14:14:34,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,610 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 14:14:34,612 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 14:14:34,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,621 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,622 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 14:14:34,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,622 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:34,623 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:34,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,641 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 14:14:34,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,644 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 14:14:34,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,657 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 14:14:34,657 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,658 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 14:14:34,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,658 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:34,659 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:34,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,671 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 14:14:34,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,673 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 14:14:34,673 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 14:14:34,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,683 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,683 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 14:14:34,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,683 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:34,684 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:34,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2023-02-15 14:14:34,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,704 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 14:14:34,706 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 14:14:34,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:34,715 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,715 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-15 14:14:34,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,716 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:34,724 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:34,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,753 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 14:14:34,753 INFO L490 LassoAnalysis]: Using template '4-phase'. [2023-02-15 14:14:34,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,754 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 14:14:34,756 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 14:14:34,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,767 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,767 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 14:14:34,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,767 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 14:14:34,769 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 14:14:34,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,792 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 14:14:34,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,793 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 14:14:34,796 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 14:14:34,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,804 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,805 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 14:14:34,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,805 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 14:14:34,806 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 14:14:34,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,826 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 14:14:34,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,827 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 14:14:34,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 14:14:34,843 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,843 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 14:14:34,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,843 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 14:14:34,845 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 14:14:34,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,849 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 14:14:34,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:34,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,862 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 14:14:34,864 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 14:14:34,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,873 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,873 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 14:14:34,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,874 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 14:14:34,875 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 14:14:34,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:34,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,910 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 14:14:34,912 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 14:14:34,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,922 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,922 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 14:14:34,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,922 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 14:14:34,923 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 14:14:34,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,944 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 14:14:34,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,945 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 14:14:34,946 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 14:14:34,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:34,954 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,955 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 14:14:34,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,955 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 14:14:34,956 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 14:14:34,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:34,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:34,980 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 14:14:34,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:34,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:34,982 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 14:14:34,985 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 14:14:34,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 14:14:34,997 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:34,997 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 14:14:34,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:34,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:34,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:34,997 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-15 14:14:35,006 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-15 14:14:35,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,040 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 14:14:35,041 INFO L490 LassoAnalysis]: Using template '2-lex'. [2023-02-15 14:14:35,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:35,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,042 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 14:14:35,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:35,057 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:35,057 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 14:14:35,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:35,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:35,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:35,057 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:35,058 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:35,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,060 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 14:14:35,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,076 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 14:14:35,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:35,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,078 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 14:14:35,080 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 14:14:35,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:35,089 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:35,089 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 14:14:35,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:35,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:35,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:35,090 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:35,090 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:35,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,116 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,120 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 14:14:35,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:35,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,122 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 14:14:35,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:35,136 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:35,137 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 14:14:35,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:35,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:35,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:35,137 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:35,138 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:35,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,140 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 14:14:35,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,160 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 14:14:35,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:35,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,162 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 14:14:35,166 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 14:14:35,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:35,174 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:35,175 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 14:14:35,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:35,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:35,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:35,175 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:35,175 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:35,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,197 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,200 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 14:14:35,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:35,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,202 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 14:14:35,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:35,216 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:35,216 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 14:14:35,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:35,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:35,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:35,216 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:35,217 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:35,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,219 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 14:14:35,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,240 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 14:14:35,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:35,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,242 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 14:14:35,245 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 14:14:35,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:35,253 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:35,254 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 14:14:35,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:35,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:35,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:35,254 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:35,255 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:35,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,275 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 14:14:35,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:35,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,276 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 14:14:35,279 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 14:14:35,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:35,286 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:35,286 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-15 14:14:35,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:35,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:35,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:35,286 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-15 14:14:35,292 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:14:35,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,310 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 14:14:35,310 INFO L490 LassoAnalysis]: Using template '3-lex'. [2023-02-15 14:14:35,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:35,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,311 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 14:14:35,312 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 14:14:35,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:35,320 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:35,321 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 14:14:35,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:35,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:35,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:35,321 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 14:14:35,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:35,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,336 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 14:14:35,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:35,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,337 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 14:14:35,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:35,341 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 14:14:35,347 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:35,347 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 14:14:35,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:35,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:35,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:35,348 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 14:14:35,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:35,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,359 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 14:14:35,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:35,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,360 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 14:14:35,361 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 14:14:35,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:35,370 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:35,370 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 14:14:35,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:35,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:35,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:35,370 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 14:14:35,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:35,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,378 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 14:14:35,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:35,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,384 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 14:14:35,384 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 14:14:35,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:35,391 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:35,391 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 14:14:35,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:35,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:35,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:35,392 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 14:14:35,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:35,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2023-02-15 14:14:35,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:35,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,405 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 14:14:35,406 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 14:14:35,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:35,414 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:35,414 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 14:14:35,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:35,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:35,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:35,415 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 14:14:35,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:35,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:35,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:35,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,445 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 14:14:35,445 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 14:14:35,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:35,459 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:35,459 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 14:14:35,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:35,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:35,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:35,459 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 14:14:35,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:35,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:35,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:35,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,506 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 14:14:35,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:35,522 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-15 14:14:35,522 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-15 14:14:35,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:35,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:35,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:35,523 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-15 14:14:35,523 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 14:14:35,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:35,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:35,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:35,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:35,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:35,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 14:14:35,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 14:14:35,569 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 14:14:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:35,601 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2023-02-15 14:14:35,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 55 transitions. [2023-02-15 14:14:35,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2023-02-15 14:14:35,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 55 transitions. [2023-02-15 14:14:35,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2023-02-15 14:14:35,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2023-02-15 14:14:35,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 55 transitions. [2023-02-15 14:14:35,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:14:35,605 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 55 transitions. [2023-02-15 14:14:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 55 transitions. [2023-02-15 14:14:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2023-02-15 14:14:35,609 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 14:14:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2023-02-15 14:14:35,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-02-15 14:14:35,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 14:14:35,611 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-02-15 14:14:35,611 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-15 14:14:35,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2023-02-15 14:14:35,612 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-02-15 14:14:35,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:35,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:35,613 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 14:14:35,613 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 14:14:35,614 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 14:14:35,614 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 14:14:35,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:35,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 4 times [2023-02-15 14:14:35,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:35,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653953879] [2023-02-15 14:14:35,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:35,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:35,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:35,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:35,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:35,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1909923709, now seen corresponding path program 1 times [2023-02-15 14:14:35,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:35,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473221398] [2023-02-15 14:14:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:35,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:35,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:14:35,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083018241] [2023-02-15 14:14:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:35,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:35,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,630 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:14:35,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2023-02-15 14:14:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:35,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:14:35,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:35,728 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 14:14:35,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:14:35,798 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 14:14:35,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:35,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473221398] [2023-02-15 14:14:35,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 14:14:35,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083018241] [2023-02-15 14:14:35,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083018241] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:14:35,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 14:14:35,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-02-15 14:14:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978597175] [2023-02-15 14:14:35,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 14:14:35,800 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:14:35,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:35,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 14:14:35,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 14:14:35,801 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 14:14:35,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:35,914 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2023-02-15 14:14:35,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 62 transitions. [2023-02-15 14:14:35,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2023-02-15 14:14:35,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 62 transitions. [2023-02-15 14:14:35,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2023-02-15 14:14:35,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2023-02-15 14:14:35,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2023-02-15 14:14:35,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:14:35,924 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2023-02-15 14:14:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2023-02-15 14:14:35,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2023-02-15 14:14:35,928 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 14:14:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2023-02-15 14:14:35,928 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 48 transitions. [2023-02-15 14:14:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 14:14:35,929 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 48 transitions. [2023-02-15 14:14:35,929 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-15 14:14:35,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 48 transitions. [2023-02-15 14:14:35,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2023-02-15 14:14:35,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:35,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:35,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 14:14:35,931 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 14:14:35,931 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 14:14:35,931 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 14:14:35,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:35,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 5 times [2023-02-15 14:14:35,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:35,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136507917] [2023-02-15 14:14:35,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:35,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:35,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:35,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:35,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash -743603515, now seen corresponding path program 1 times [2023-02-15 14:14:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:35,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374764383] [2023-02-15 14:14:35,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:35,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:35,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:14:35,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029203583] [2023-02-15 14:14:35,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:35,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:35,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:35,946 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:14:35,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2023-02-15 14:14:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:35,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:35,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:35,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:35,995 INFO L85 PathProgramCache]: Analyzing trace with hash 343305470, now seen corresponding path program 1 times [2023-02-15 14:14:35,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:35,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886219392] [2023-02-15 14:14:35,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:35,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:36,003 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:14:36,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1211927041] [2023-02-15 14:14:36,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:36,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:36,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:36,008 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:14:36,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2023-02-15 14:14:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:36,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:36,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:36,276 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:36,276 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:36,276 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:36,276 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:36,277 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:14:36,277 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:36,277 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:36,277 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:36,277 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2023-02-15 14:14:36,277 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:36,277 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:36,280 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 14:14:36,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 14:14:36,301 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 14:14:36,303 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 14:14:36,305 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 14:14:36,308 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 14:14:36,310 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 14:14:36,313 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 14:14:36,408 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:36,408 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:14:36,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:36,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:36,417 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 14:14:36,418 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 14:14:36,419 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:36,420 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:36,441 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:36,441 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 14:14:36,445 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 14:14:36,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:36,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:36,446 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 14:14:36,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:36,453 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:36,463 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 14:14:36,475 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 14:14:36,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:36,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:36,477 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 14:14:36,477 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 14:14:36,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:14:36,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:36,858 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:14:36,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2023-02-15 14:14:36,863 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:36,863 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:36,863 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:36,863 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:36,863 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:36,863 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:36,863 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:36,863 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:36,863 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2023-02-15 14:14:36,863 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:36,863 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:36,864 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 14:14:36,867 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 14:14:36,881 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 14:14:36,886 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 14:14:36,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 14:14:36,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 14:14:36,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 14:14:36,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 14:14:36,977 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:36,977 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:36,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:36,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:36,981 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 14:14:36,984 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 14:14:36,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:14:36,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:36,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:36,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:36,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:36,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:36,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:36,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:37,004 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:37,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:37,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:37,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:37,012 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 14:14:37,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:37,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:37,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:37,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:37,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:37,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:37,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:37,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:37,030 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 14:14:37,048 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:37,052 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:14:37,052 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:14:37,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:37,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:37,056 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 14:14:37,057 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 14:14:37,059 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:37,059 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:14:37,059 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:37,059 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 14:14:37,062 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 14:14:37,062 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:14:37,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:37,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:14:37,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:37,102 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 14:14:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:37,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 14:14:37,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:37,227 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 14:14:37,228 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 14:14:37,228 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 14:14:37,452 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 14:14:37,452 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 14:14:37,453 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 14:14:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2023-02-15 14:14:37,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 23 letters. [2023-02-15 14:14:37,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:37,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 27 letters. Loop has 23 letters. [2023-02-15 14:14:37,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:37,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 46 letters. [2023-02-15 14:14:37,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:37,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 190 transitions. [2023-02-15 14:14:37,458 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-02-15 14:14:37,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 122 states and 189 transitions. [2023-02-15 14:14:37,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2023-02-15 14:14:37,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2023-02-15 14:14:37,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 189 transitions. [2023-02-15 14:14:37,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:37,462 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 189 transitions. [2023-02-15 14:14:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 189 transitions. [2023-02-15 14:14:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2023-02-15 14:14:37,471 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 14:14:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2023-02-15 14:14:37,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 180 transitions. [2023-02-15 14:14:37,473 INFO L428 stractBuchiCegarLoop]: Abstraction has 117 states and 180 transitions. [2023-02-15 14:14:37,473 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-15 14:14:37,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 180 transitions. [2023-02-15 14:14:37,474 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-02-15 14:14:37,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:37,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:37,475 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 14:14:37,475 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 14:14:37,475 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 14:14:37,475 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 14:14:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:37,476 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2023-02-15 14:14:37,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:37,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049074712] [2023-02-15 14:14:37,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:37,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:37,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:37,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:37,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:37,492 INFO L85 PathProgramCache]: Analyzing trace with hash -304298247, now seen corresponding path program 2 times [2023-02-15 14:14:37,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:37,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850624125] [2023-02-15 14:14:37,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:37,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:37,497 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:14:37,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [271687703] [2023-02-15 14:14:37,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 14:14:37,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:37,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:37,499 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 14:14:37,503 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 14:14:37,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 14:14:37,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:14:37,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 14:14:37,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:37,584 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 14:14:37,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:14:37,705 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 14:14:37,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:37,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850624125] [2023-02-15 14:14:37,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 14:14:37,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271687703] [2023-02-15 14:14:37,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271687703] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:14:37,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 14:14:37,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-02-15 14:14:37,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781174759] [2023-02-15 14:14:37,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 14:14:37,707 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:14:37,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:37,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 14:14:37,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-15 14:14:37,708 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 14:14:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:37,923 INFO L93 Difference]: Finished difference Result 249 states and 362 transitions. [2023-02-15 14:14:37,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 362 transitions. [2023-02-15 14:14:37,927 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 87 [2023-02-15 14:14:37,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 249 states and 362 transitions. [2023-02-15 14:14:37,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2023-02-15 14:14:37,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2023-02-15 14:14:37,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 249 states and 362 transitions. [2023-02-15 14:14:37,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:37,932 INFO L218 hiAutomatonCegarLoop]: Abstraction has 249 states and 362 transitions. [2023-02-15 14:14:37,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 362 transitions. [2023-02-15 14:14:37,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 131. [2023-02-15 14:14:37,944 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 14:14:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 202 transitions. [2023-02-15 14:14:37,945 INFO L240 hiAutomatonCegarLoop]: Abstraction has 131 states and 202 transitions. [2023-02-15 14:14:37,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 14:14:37,946 INFO L428 stractBuchiCegarLoop]: Abstraction has 131 states and 202 transitions. [2023-02-15 14:14:37,947 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-15 14:14:37,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 202 transitions. [2023-02-15 14:14:37,948 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2023-02-15 14:14:37,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:37,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:37,949 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 14:14:37,949 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 14:14:37,949 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 14:14:37,949 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 14:14:37,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2023-02-15 14:14:37,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:37,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081033107] [2023-02-15 14:14:37,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:37,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:37,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:37,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:37,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1403101825, now seen corresponding path program 3 times [2023-02-15 14:14:37,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:37,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667168022] [2023-02-15 14:14:37,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:37,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:37,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:14:37,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2103024652] [2023-02-15 14:14:37,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 14:14:37,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:37,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:37,961 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 14:14:37,973 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 14:14:38,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-15 14:14:38,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:14:38,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 14:14:38,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:38,042 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 14:14:38,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 14:14:38,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:38,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667168022] [2023-02-15 14:14:38,042 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 14:14:38,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103024652] [2023-02-15 14:14:38,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103024652] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:38,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:38,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 14:14:38,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281967465] [2023-02-15 14:14:38,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:38,043 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:14:38,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:38,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 14:14:38,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 14:14:38,044 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 14:14:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:38,098 INFO L93 Difference]: Finished difference Result 173 states and 268 transitions. [2023-02-15 14:14:38,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 268 transitions. [2023-02-15 14:14:38,101 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2023-02-15 14:14:38,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 167 states and 262 transitions. [2023-02-15 14:14:38,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2023-02-15 14:14:38,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2023-02-15 14:14:38,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 262 transitions. [2023-02-15 14:14:38,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:38,105 INFO L218 hiAutomatonCegarLoop]: Abstraction has 167 states and 262 transitions. [2023-02-15 14:14:38,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 262 transitions. [2023-02-15 14:14:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. [2023-02-15 14:14:38,114 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 14:14:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 208 transitions. [2023-02-15 14:14:38,116 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 208 transitions. [2023-02-15 14:14:38,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 14:14:38,117 INFO L428 stractBuchiCegarLoop]: Abstraction has 137 states and 208 transitions. [2023-02-15 14:14:38,117 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-15 14:14:38,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 208 transitions. [2023-02-15 14:14:38,119 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2023-02-15 14:14:38,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:38,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:38,120 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 14:14:38,120 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 14:14:38,120 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 14:14:38,120 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 14:14:38,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:38,121 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2023-02-15 14:14:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:38,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618539885] [2023-02-15 14:14:38,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:38,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:38,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:38,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:38,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1715041092, now seen corresponding path program 1 times [2023-02-15 14:14:38,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:38,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045026288] [2023-02-15 14:14:38,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:38,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:38,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:14:38,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399802670] [2023-02-15 14:14:38,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:38,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:38,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:38,136 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 14:14:38,162 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 14:14:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:38,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:14:38,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:38,320 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 14:14:38,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:14:38,538 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 14:14:38,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:38,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045026288] [2023-02-15 14:14:38,539 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 14:14:38,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399802670] [2023-02-15 14:14:38,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399802670] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:14:38,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 14:14:38,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-02-15 14:14:38,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356783253] [2023-02-15 14:14:38,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 14:14:38,540 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:14:38,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:38,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 14:14:38,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-02-15 14:14:38,540 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 14:14:38,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:38,991 INFO L93 Difference]: Finished difference Result 270 states and 395 transitions. [2023-02-15 14:14:38,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 395 transitions. [2023-02-15 14:14:38,994 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 105 [2023-02-15 14:14:38,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 395 transitions. [2023-02-15 14:14:38,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2023-02-15 14:14:38,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2023-02-15 14:14:38,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 395 transitions. [2023-02-15 14:14:38,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:38,998 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 395 transitions. [2023-02-15 14:14:38,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 395 transitions. [2023-02-15 14:14:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 185. [2023-02-15 14:14:39,012 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 14:14:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 272 transitions. [2023-02-15 14:14:39,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 185 states and 272 transitions. [2023-02-15 14:14:39,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 14:14:39,018 INFO L428 stractBuchiCegarLoop]: Abstraction has 185 states and 272 transitions. [2023-02-15 14:14:39,018 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-15 14:14:39,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 272 transitions. [2023-02-15 14:14:39,019 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2023-02-15 14:14:39,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:39,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:39,020 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 14:14:39,021 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 14:14:39,021 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 14:14:39,021 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 14:14:39,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:39,021 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 4 times [2023-02-15 14:14:39,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:39,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388772441] [2023-02-15 14:14:39,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:39,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:39,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:39,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:39,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:39,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1813506637, now seen corresponding path program 2 times [2023-02-15 14:14:39,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:39,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512560544] [2023-02-15 14:14:39,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:39,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:39,044 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:14:39,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064238147] [2023-02-15 14:14:39,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 14:14:39,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:39,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:39,047 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:14:39,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2023-02-15 14:14:39,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 14:14:39,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:14:39,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 14:14:39,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:39,230 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 14:14:39,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:14:39,616 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 14:14:39,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:39,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512560544] [2023-02-15 14:14:39,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 14:14:39,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064238147] [2023-02-15 14:14:39,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064238147] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:14:39,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 14:14:39,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 18 [2023-02-15 14:14:39,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929850765] [2023-02-15 14:14:39,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 14:14:39,619 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:14:39,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:39,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 14:14:39,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-02-15 14:14:39,620 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 14:14:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:40,106 INFO L93 Difference]: Finished difference Result 337 states and 498 transitions. [2023-02-15 14:14:40,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 498 transitions. [2023-02-15 14:14:40,111 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 86 [2023-02-15 14:14:40,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 337 states and 498 transitions. [2023-02-15 14:14:40,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2023-02-15 14:14:40,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2023-02-15 14:14:40,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 337 states and 498 transitions. [2023-02-15 14:14:40,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:40,117 INFO L218 hiAutomatonCegarLoop]: Abstraction has 337 states and 498 transitions. [2023-02-15 14:14:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states and 498 transitions. [2023-02-15 14:14:40,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 211. [2023-02-15 14:14:40,128 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 14:14:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 316 transitions. [2023-02-15 14:14:40,129 INFO L240 hiAutomatonCegarLoop]: Abstraction has 211 states and 316 transitions. [2023-02-15 14:14:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 14:14:40,132 INFO L428 stractBuchiCegarLoop]: Abstraction has 211 states and 316 transitions. [2023-02-15 14:14:40,132 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-15 14:14:40,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 316 transitions. [2023-02-15 14:14:40,134 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2023-02-15 14:14:40,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:40,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:40,141 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 14:14:40,141 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 14:14:40,141 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 14:14:40,143 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 14:14:40,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 5 times [2023-02-15 14:14:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:40,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303555728] [2023-02-15 14:14:40,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:40,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:40,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:40,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:40,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash 590406435, now seen corresponding path program 3 times [2023-02-15 14:14:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:40,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162868172] [2023-02-15 14:14:40,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:40,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:40,170 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:14:40,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [948602711] [2023-02-15 14:14:40,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 14:14:40,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:40,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:40,174 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:14:40,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2023-02-15 14:14:40,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-15 14:14:40,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 14:14:40,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:40,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:40,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash -552239216, now seen corresponding path program 1 times [2023-02-15 14:14:40,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:40,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881248651] [2023-02-15 14:14:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:40,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:40,324 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:14:40,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802678725] [2023-02-15 14:14:40,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:40,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:40,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:40,328 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:14:40,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2023-02-15 14:14:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:40,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:14:40,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:40,435 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 14:14:40,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:14:40,536 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 14:14:40,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:40,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881248651] [2023-02-15 14:14:40,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 14:14:40,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802678725] [2023-02-15 14:14:40,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802678725] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:14:40,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 14:14:40,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-02-15 14:14:40,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181046630] [2023-02-15 14:14:40,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 14:14:43,846 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:43,846 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:43,846 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:43,846 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:43,846 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:14:43,846 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:43,846 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:43,846 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:43,847 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2023-02-15 14:14:43,847 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:43,847 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:43,848 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 14:14:43,851 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 14:14:43,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 14:14:43,856 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 14:14:43,858 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 14:14:46,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 14:14:46,128 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 14:14:46,129 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 14:14:46,131 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 14:14:46,577 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2023-02-15 14:14:46,930 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:46,930 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:14:46,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:46,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:46,935 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 14:14:46,936 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 14:14:46,937 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:46,937 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:46,943 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:46,943 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 14:14:46,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:46,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:46,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:46,947 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 14:14:46,948 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 14:14:46,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:46,950 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:46,956 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:46,956 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 14:14:46,959 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 14:14:46,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:46,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:46,960 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 14:14:46,961 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 14:14:46,963 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:46,963 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:46,969 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:46,969 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:14:46,972 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 14:14:46,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:46,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:46,973 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:46,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2023-02-15 14:14:46,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:46,976 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:46,982 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:46,983 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 14:14:46,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:46,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:46,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:46,986 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:46,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2023-02-15 14:14:46,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:46,989 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:46,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2023-02-15 14:14:47,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:47,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:47,001 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:47,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2023-02-15 14:14:47,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:14:47,004 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:47,023 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:14:47,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2023-02-15 14:14:47,025 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:47,025 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:47,026 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:47,026 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:47,026 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:47,026 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:47,026 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:47,026 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:47,026 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2023-02-15 14:14:47,026 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:47,026 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:47,027 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 14:14:47,029 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 14:14:47,031 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 14:14:47,032 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 14:14:47,036 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 14:15:24,262 WARN L233 SmtUtils]: Spent 37.21s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.setFormulaAndSimplify) [2023-02-15 14:15:24,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 14:15:24,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 14:15:24,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 14:15:24,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 14:15:24,838 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2023-02-15 14:15:25,106 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:25,106 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:25,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:25,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:25,108 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:25,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2023-02-15 14:15:25,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:15:25,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:25,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:25,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:25,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:25,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:25,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:25,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:25,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:25,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:25,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:25,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:25,142 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:25,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2023-02-15 14:15:25,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:15:25,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:25,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:25,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:25,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:25,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:25,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:25,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:25,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:25,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:25,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:25,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:25,160 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:25,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2023-02-15 14:15:25,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:25,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:25,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:25,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:25,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:25,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:25,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:25,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:25,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:25,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2023-02-15 14:15:25,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:25,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:25,176 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 14:15:25,177 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 14:15:25,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:15:25,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:25,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:25,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:25,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:25,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:25,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:25,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:25,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:25,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2023-02-15 14:15:25,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:25,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:25,194 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 14:15:25,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:15:25,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:25,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:25,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:25,205 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-15 14:15:25,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:25,209 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:15:25,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:25,215 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 14:15:25,226 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:25,230 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:25,230 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:15:25,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:25,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:25,232 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 14:15:25,233 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 14:15:25,234 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:25,234 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:25,234 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:25,234 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 14:15:25,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:25,237 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:25,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:25,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 14:15:25,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:25,634 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 14:15:25,635 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 14:15:25,635 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 14:15:25,912 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 14:15:25,912 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 14:15:25,913 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 14:15:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2023-02-15 14:15:25,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 84 transitions. Stem has 5 letters. Loop has 111 letters. [2023-02-15 14:15:25,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:25,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 84 transitions. Stem has 116 letters. Loop has 111 letters. [2023-02-15 14:15:25,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:25,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 84 transitions. Stem has 5 letters. Loop has 222 letters. [2023-02-15 14:15:25,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:25,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 607 states and 918 transitions. [2023-02-15 14:15:25,926 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 77 [2023-02-15 14:15:25,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 607 states to 410 states and 616 transitions. [2023-02-15 14:15:25,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2023-02-15 14:15:25,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2023-02-15 14:15:25,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 410 states and 616 transitions. [2023-02-15 14:15:25,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:25,932 INFO L218 hiAutomatonCegarLoop]: Abstraction has 410 states and 616 transitions. [2023-02-15 14:15:25,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states and 616 transitions. [2023-02-15 14:15:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 394. [2023-02-15 14:15:25,944 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 14:15:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 592 transitions. [2023-02-15 14:15:25,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 394 states and 592 transitions. [2023-02-15 14:15:25,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:25,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 14:15:25,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 14:15:25,949 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 14:15:26,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:26,073 INFO L93 Difference]: Finished difference Result 448 states and 677 transitions. [2023-02-15 14:15:26,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 448 states and 677 transitions. [2023-02-15 14:15:26,078 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 83 [2023-02-15 14:15:26,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 448 states to 439 states and 663 transitions. [2023-02-15 14:15:26,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2023-02-15 14:15:26,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2023-02-15 14:15:26,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 439 states and 663 transitions. [2023-02-15 14:15:26,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:26,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 439 states and 663 transitions. [2023-02-15 14:15:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states and 663 transitions. [2023-02-15 14:15:26,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:26,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2023-02-15 14:15:26,110 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 14:15:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 661 transitions. [2023-02-15 14:15:26,113 INFO L240 hiAutomatonCegarLoop]: Abstraction has 437 states and 661 transitions. [2023-02-15 14:15:26,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 14:15:26,116 INFO L428 stractBuchiCegarLoop]: Abstraction has 437 states and 661 transitions. [2023-02-15 14:15:26,116 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-15 14:15:26,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 437 states and 661 transitions. [2023-02-15 14:15:26,118 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 83 [2023-02-15 14:15:26,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:26,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:26,119 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:15:26,119 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 14:15:26,119 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; 7015#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 14:15:26,119 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 14:15:26,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:26,120 INFO L85 PathProgramCache]: Analyzing trace with hash 271623377, now seen corresponding path program 1 times [2023-02-15 14:15:26,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:26,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637599087] [2023-02-15 14:15:26,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:26,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:26,168 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 14:15:26,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:26,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637599087] [2023-02-15 14:15:26,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637599087] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:15:26,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:15:26,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 14:15:26,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078745490] [2023-02-15 14:15:26,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:15:26,170 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:26,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:26,170 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 1 times [2023-02-15 14:15:26,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:26,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394476355] [2023-02-15 14:15:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:26,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:26,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:26,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:26,193 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:26,193 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:26,193 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:26,193 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:26,193 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:26,193 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:26,193 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:26,194 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:26,194 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2023-02-15 14:15:26,194 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:26,194 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:26,194 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 14:15:26,198 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 14:15:26,200 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 14:15:26,201 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 14:15:26,217 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:26,217 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:26,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:26,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:26,218 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 14:15:26,219 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 14:15:26,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:26,221 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:26,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2023-02-15 14:15:26,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:26,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:26,231 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 14:15:26,233 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 14:15:26,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:26,234 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:26,276 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:26,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:26,279 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:26,279 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:26,279 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:26,279 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:26,279 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:26,279 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:26,279 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:26,279 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:26,279 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2023-02-15 14:15:26,280 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:26,280 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:26,280 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 14:15:26,284 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 14:15:26,285 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 14:15:26,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 14:15:26,302 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:26,303 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:26,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:26,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:26,304 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 14:15:26,305 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 14:15:26,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:26,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:26,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:26,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:26,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:26,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:26,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:26,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:26,315 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:26,316 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:26,316 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:26,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:26,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:26,318 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 14:15:26,320 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 14:15:26,321 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:26,321 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:26,321 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:26,321 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2023-02-15 14:15:26,324 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 14:15:26,324 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:26,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:26,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:15:26,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:26,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 14:15:26,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:26,381 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 14:15:26,382 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 14:15:26,383 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 14:15:26,424 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 14:15:26,424 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 14:15:26,425 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 14:15:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2023-02-15 14:15:26,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 11 letters. Loop has 3 letters. [2023-02-15 14:15:26,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:26,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-15 14:15:26,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:26,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-15 14:15:26,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:26,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 738 transitions. [2023-02-15 14:15:26,432 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 83 [2023-02-15 14:15:26,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 483 states and 716 transitions. [2023-02-15 14:15:26,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2023-02-15 14:15:26,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2023-02-15 14:15:26,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 716 transitions. [2023-02-15 14:15:26,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:26,438 INFO L218 hiAutomatonCegarLoop]: Abstraction has 483 states and 716 transitions. [2023-02-15 14:15:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 716 transitions. [2023-02-15 14:15:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 479. [2023-02-15 14:15:26,449 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 14:15:26,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 708 transitions. [2023-02-15 14:15:26,452 INFO L240 hiAutomatonCegarLoop]: Abstraction has 479 states and 708 transitions. [2023-02-15 14:15:26,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:26,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 14:15:26,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 14:15:26,452 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 14:15:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:26,510 INFO L93 Difference]: Finished difference Result 482 states and 710 transitions. [2023-02-15 14:15:26,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 710 transitions. [2023-02-15 14:15:26,515 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 83 [2023-02-15 14:15:26,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 474 states and 700 transitions. [2023-02-15 14:15:26,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2023-02-15 14:15:26,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2023-02-15 14:15:26,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 474 states and 700 transitions. [2023-02-15 14:15:26,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:26,521 INFO L218 hiAutomatonCegarLoop]: Abstraction has 474 states and 700 transitions. [2023-02-15 14:15:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states and 700 transitions. [2023-02-15 14:15:26,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 473. [2023-02-15 14:15:26,532 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 14:15:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 699 transitions. [2023-02-15 14:15:26,535 INFO L240 hiAutomatonCegarLoop]: Abstraction has 473 states and 699 transitions. [2023-02-15 14:15:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 14:15:26,536 INFO L428 stractBuchiCegarLoop]: Abstraction has 473 states and 699 transitions. [2023-02-15 14:15:26,536 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-15 14:15:26,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 473 states and 699 transitions. [2023-02-15 14:15:26,539 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 83 [2023-02-15 14:15:26,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:26,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:26,540 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 14:15:26,540 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 14:15:26,540 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; 9059#factEXIT >#74#return; 8913#L30-6 [2023-02-15 14:15:26,541 INFO L750 eck$LassoCheckResult]: Loop: 8913#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 8945#$Ultimate##0 ~n := #in~n; 9089#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; 9059#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; 9059#factEXIT >#78#return; 9061#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; 9104#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 9095#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 9092#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; 9066#factFINAL assume true; 9067#factEXIT >#74#return; 8913#L30-6 [2023-02-15 14:15:26,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:26,541 INFO L85 PathProgramCache]: Analyzing trace with hash -426322681, now seen corresponding path program 1 times [2023-02-15 14:15:26,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:26,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121837567] [2023-02-15 14:15:26,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:26,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:26,547 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:15:26,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009418076] [2023-02-15 14:15:26,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:26,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:26,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:26,548 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:26,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2023-02-15 14:15:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:26,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:26,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:26,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:26,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1167330940, now seen corresponding path program 1 times [2023-02-15 14:15:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:26,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286424778] [2023-02-15 14:15:26,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:26,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:26,616 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:15:26,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123630178] [2023-02-15 14:15:26,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:26,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:26,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:26,620 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:26,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2023-02-15 14:15:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:26,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:26,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:26,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:26,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1873696258, now seen corresponding path program 1 times [2023-02-15 14:15:26,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:26,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443127557] [2023-02-15 14:15:26,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:26,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:26,684 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:15:26,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [697911596] [2023-02-15 14:15:26,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:26,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:26,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:26,687 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:26,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2023-02-15 14:15:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:26,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:15:26,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:26,769 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 14:15:26,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:26,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:26,900 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 14:15:26,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:26,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443127557] [2023-02-15 14:15:26,901 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 14:15:26,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697911596] [2023-02-15 14:15:26,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697911596] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:26,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 14:15:26,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-02-15 14:15:26,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099944193] [2023-02-15 14:15:26,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:27,386 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:27,386 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:27,386 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:27,386 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:27,386 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:27,387 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:27,387 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:27,387 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:27,387 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2023-02-15 14:15:27,387 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:27,387 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:27,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 14:15:27,389 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 14:15:27,417 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 14:15:27,419 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 14:15:27,427 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 14:15:27,428 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 14:15:27,522 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:27,522 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:27,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:27,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:27,525 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 14:15:27,533 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:27,533 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:27,542 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 14:15:27,545 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:27,545 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 14:15:27,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:27,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:27,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:27,549 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 14:15:27,551 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 14:15:27,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:27,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:27,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:27,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:27,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:27,565 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 14:15:27,566 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 14:15:27,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:27,568 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:27,593 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:27,596 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 14:15:27,596 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:27,596 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:27,596 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:27,596 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:27,596 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:27,596 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:27,596 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:27,596 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:27,596 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2023-02-15 14:15:27,596 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:27,596 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:27,597 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 14:15:27,599 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 14:15:27,620 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 14:15:27,621 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 14:15:27,623 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 14:15:27,624 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 14:15:27,704 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:27,704 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:27,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:27,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:27,706 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 14:15:27,707 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 14:15:27,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:15:27,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:27,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:27,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:27,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:27,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:27,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:27,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:27,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:27,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:27,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:27,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:27,720 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:27,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2023-02-15 14:15:27,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:15:27,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:27,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:27,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:27,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:27,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:27,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:27,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:27,734 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:27,738 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-15 14:15:27,738 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:27,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:27,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:27,740 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:27,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2023-02-15 14:15:27,742 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:27,742 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:27,742 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:27,742 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 14:15:27,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:27,746 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:27,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:15:27,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-15 14:15:27,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:28,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:28,166 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 14:15:28,166 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 14:15:28,166 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 14:15:28,443 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 14:15:28,444 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 14:15:28,444 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 14:15:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2023-02-15 14:15:28,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 80 transitions. Stem has 38 letters. Loop has 50 letters. [2023-02-15 14:15:28,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:28,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 80 transitions. Stem has 88 letters. Loop has 50 letters. [2023-02-15 14:15:28,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:28,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 80 transitions. Stem has 38 letters. Loop has 100 letters. [2023-02-15 14:15:28,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:28,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 802 states and 1121 transitions. [2023-02-15 14:15:28,459 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 86 [2023-02-15 14:15:28,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 802 states to 800 states and 1119 transitions. [2023-02-15 14:15:28,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 265 [2023-02-15 14:15:28,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 266 [2023-02-15 14:15:28,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 800 states and 1119 transitions. [2023-02-15 14:15:28,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:28,468 INFO L218 hiAutomatonCegarLoop]: Abstraction has 800 states and 1119 transitions. [2023-02-15 14:15:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states and 1119 transitions. [2023-02-15 14:15:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 670. [2023-02-15 14:15:28,486 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 14:15:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 959 transitions. [2023-02-15 14:15:28,490 INFO L240 hiAutomatonCegarLoop]: Abstraction has 670 states and 959 transitions. [2023-02-15 14:15:28,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:28,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 14:15:28,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 14:15:28,491 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 14:15:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:28,589 INFO L93 Difference]: Finished difference Result 686 states and 963 transitions. [2023-02-15 14:15:28,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 686 states and 963 transitions. [2023-02-15 14:15:28,594 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 86 [2023-02-15 14:15:28,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 686 states to 671 states and 933 transitions. [2023-02-15 14:15:28,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 233 [2023-02-15 14:15:28,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 233 [2023-02-15 14:15:28,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 671 states and 933 transitions. [2023-02-15 14:15:28,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:28,601 INFO L218 hiAutomatonCegarLoop]: Abstraction has 671 states and 933 transitions. [2023-02-15 14:15:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states and 933 transitions. [2023-02-15 14:15:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 663. [2023-02-15 14:15:28,616 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 14:15:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 923 transitions. [2023-02-15 14:15:28,619 INFO L240 hiAutomatonCegarLoop]: Abstraction has 663 states and 923 transitions. [2023-02-15 14:15:28,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 14:15:28,620 INFO L428 stractBuchiCegarLoop]: Abstraction has 663 states and 923 transitions. [2023-02-15 14:15:28,620 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-15 14:15:28,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 663 states and 923 transitions. [2023-02-15 14:15:28,624 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 86 [2023-02-15 14:15:28,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:28,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:28,625 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 14:15:28,625 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 14:15:28,625 INFO L748 eck$LassoCheckResult]: Stem: 12465#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 12402#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; 12403#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 12426#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; 12413#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 12414#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 12929#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; 12926#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 12927#$Ultimate##0 ~n := #in~n; 12933#L25 assume ~n <= 0;#res := 1; 12932#factFINAL assume true; 12925#factEXIT >#68#return; 12897#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 12922#$Ultimate##0 ~n := #in~n; 12924#L25 assume ~n <= 0;#res := 1; 12923#factFINAL assume true; 12921#factEXIT >#70#return; 12898#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 12922#$Ultimate##0 ~n := #in~n; 12924#L25 assume ~n <= 0;#res := 1; 12923#factFINAL assume true; 12921#factEXIT >#72#return; 12920#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; 12919#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 12918#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 12912#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 12909#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; 12899#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 12900#$Ultimate##0 ~n := #in~n; 12917#L25 assume !(~n <= 0); 12914#L26 call #t~ret0 := fact(~n - 1);< 12915#$Ultimate##0 ~n := #in~n; 12939#L25 assume ~n <= 0;#res := 1; 12940#factFINAL assume true; 12913#factEXIT >#66#return; 12910#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 12908#factFINAL assume true; 12896#factEXIT >#74#return; 12408#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 12879#$Ultimate##0 ~n := #in~n; 12985#L25 assume !(~n <= 0); 12386#L26 call #t~ret0 := fact(~n - 1);< 12410#$Ultimate##0 [2023-02-15 14:15:28,625 INFO L750 eck$LassoCheckResult]: Loop: 12410#$Ultimate##0 ~n := #in~n; 12452#L25 assume !(~n <= 0); 12389#L26 call #t~ret0 := fact(~n - 1);< 12410#$Ultimate##0 [2023-02-15 14:15:28,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:28,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1705579033, now seen corresponding path program 1 times [2023-02-15 14:15:28,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:28,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633827185] [2023-02-15 14:15:28,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:28,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:28,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:15:28,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [187532418] [2023-02-15 14:15:28,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:28,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:28,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:28,645 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 14:15:28,668 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 14:15:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:28,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:15:28,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:28,725 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 14:15:28,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 14:15:28,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:28,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633827185] [2023-02-15 14:15:28,725 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 14:15:28,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187532418] [2023-02-15 14:15:28,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187532418] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:15:28,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:15:28,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 14:15:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109651898] [2023-02-15 14:15:28,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:15:28,727 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:28,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:28,727 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 2 times [2023-02-15 14:15:28,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:28,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066836873] [2023-02-15 14:15:28,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:28,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:28,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:28,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:28,755 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:28,755 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:28,755 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:28,755 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:28,755 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:28,755 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:28,755 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:28,756 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:28,756 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2023-02-15 14:15:28,756 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:28,756 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:28,756 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 14:15:28,758 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 14:15:28,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 14:15:28,764 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 14:15:28,793 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:28,793 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:28,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:28,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:28,795 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 14:15:28,797 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 14:15:28,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:28,799 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:28,820 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:28,820 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 14:15:28,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:28,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:28,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:28,829 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 14:15:28,831 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 14:15:28,833 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:28,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:28,856 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:28,856 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 14:15:28,865 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 14:15:28,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:28,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:28,867 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 14:15:28,869 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 14:15:28,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:28,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:28,901 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 14:15:28,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:28,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:28,902 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 14:15:28,905 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 14:15:28,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:28,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:28,960 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:28,964 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 14:15:28,964 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:28,964 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:28,964 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:28,964 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:28,964 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:28,965 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:28,965 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:28,965 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:28,965 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2023-02-15 14:15:28,965 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:28,965 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:28,965 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 14:15:28,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 14:15:28,968 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 14:15:28,972 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 14:15:28,988 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:28,988 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:28,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:28,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:28,989 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 14:15:28,991 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 14:15:28,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:15:28,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:28,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:28,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:28,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:28,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:28,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:28,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:29,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:29,003 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 14:15:29,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:29,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:29,004 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 14:15:29,006 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 14:15:29,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:15:29,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:29,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:29,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:29,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:29,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:29,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:29,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:29,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:29,018 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 14:15:29,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:29,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:29,019 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:29,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2023-02-15 14:15:29,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:15:29,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:29,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:29,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:29,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:29,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:29,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:29,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:29,030 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:29,032 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:29,032 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:29,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:29,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:29,033 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 14:15:29,035 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 14:15:29,036 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:29,036 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:29,036 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:29,036 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2023-02-15 14:15:29,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:29,039 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:29,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:29,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 14:15:29,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 14:15:29,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:29,266 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 14:15:29,267 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 14:15:29,267 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 14:15:29,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 687 states and 951 transitions. Complement of second has 13 states. [2023-02-15 14:15:29,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 14:15:29,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 14:15:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2023-02-15 14:15:29,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 42 letters. Loop has 3 letters. [2023-02-15 14:15:29,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:29,334 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:29,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 14:15:29,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 14:15:29,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:29,546 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 14:15:29,546 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 14:15:29,546 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 14:15:29,605 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 14:15:29,606 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 14:15:29,606 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 14:15:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2023-02-15 14:15:29,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 42 letters. Loop has 3 letters. [2023-02-15 14:15:29,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:29,607 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:29,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 14:15:29,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 14:15:29,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:29,810 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 14:15:29,810 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 14:15:29,810 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 14:15:29,894 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 14:15:29,895 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 14:15:29,896 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 14:15:29,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2023-02-15 14:15:29,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 42 letters. Loop has 3 letters. [2023-02-15 14:15:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:29,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 45 letters. Loop has 3 letters. [2023-02-15 14:15:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:29,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 42 letters. Loop has 6 letters. [2023-02-15 14:15:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:29,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 805 states and 1091 transitions. [2023-02-15 14:15:29,905 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 80 [2023-02-15 14:15:29,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 805 states to 715 states and 1000 transitions. [2023-02-15 14:15:29,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 227 [2023-02-15 14:15:29,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 233 [2023-02-15 14:15:29,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 715 states and 1000 transitions. [2023-02-15 14:15:29,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:29,912 INFO L218 hiAutomatonCegarLoop]: Abstraction has 715 states and 1000 transitions. [2023-02-15 14:15:29,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states and 1000 transitions. [2023-02-15 14:15:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 697. [2023-02-15 14:15:29,940 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 14:15:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 956 transitions. [2023-02-15 14:15:29,943 INFO L240 hiAutomatonCegarLoop]: Abstraction has 697 states and 956 transitions. [2023-02-15 14:15:29,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:29,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 14:15:29,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 14:15:29,944 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 14:15:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:30,008 INFO L93 Difference]: Finished difference Result 713 states and 968 transitions. [2023-02-15 14:15:30,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 713 states and 968 transitions. [2023-02-15 14:15:30,013 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 80 [2023-02-15 14:15:30,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 713 states to 713 states and 968 transitions. [2023-02-15 14:15:30,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2023-02-15 14:15:30,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2023-02-15 14:15:30,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 713 states and 968 transitions. [2023-02-15 14:15:30,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:30,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 713 states and 968 transitions. [2023-02-15 14:15:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states and 968 transitions. [2023-02-15 14:15:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 705. [2023-02-15 14:15:30,037 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 14:15:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 958 transitions. [2023-02-15 14:15:30,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 705 states and 958 transitions. [2023-02-15 14:15:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 14:15:30,041 INFO L428 stractBuchiCegarLoop]: Abstraction has 705 states and 958 transitions. [2023-02-15 14:15:30,041 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-02-15 14:15:30,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 705 states and 958 transitions. [2023-02-15 14:15:30,044 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 80 [2023-02-15 14:15:30,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:30,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:30,046 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 14:15:30,046 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 14:15:30,046 INFO L748 eck$LassoCheckResult]: Stem: 17330#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 17279#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; 17280#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 17304#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; 17291#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 17292#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 17627#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; 17262#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17263#$Ultimate##0 ~n := #in~n; 17617#L25 assume ~n <= 0;#res := 1; 17615#factFINAL assume true; 17611#factEXIT >#68#return; 17321#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 17322#$Ultimate##0 ~n := #in~n; 17621#L25 assume ~n <= 0;#res := 1; 17620#factFINAL assume true; 17619#factEXIT >#70#return; 17259#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 17260#$Ultimate##0 ~n := #in~n; 17741#L25 assume ~n <= 0;#res := 1; 17740#factFINAL assume true; 17737#factEXIT >#72#return; 17298#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; 17299#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 17311#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 17675#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 17673#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; 17666#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17670#$Ultimate##0 ~n := #in~n; 17806#L25 assume !(~n <= 0); 17318#L26 call #t~ret0 := fact(~n - 1);< 17805#$Ultimate##0 ~n := #in~n; 17841#L25 assume ~n <= 0;#res := 1; 17840#factFINAL assume true; 17804#factEXIT >#66#return; 17803#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17773#factFINAL assume true; 17665#factEXIT >#74#return; 17664#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 17681#$Ultimate##0 ~n := #in~n; 17683#L25 assume ~n <= 0;#res := 1; 17682#factFINAL assume true; 17679#factEXIT >#76#return; 17430#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 17432#$Ultimate##0 ~n := #in~n; 17790#L25 assume !(~n <= 0); 17687#L26 call #t~ret0 := fact(~n - 1);< 17690#$Ultimate##0 ~n := #in~n; 17818#L25 assume ~n <= 0;#res := 1; 17817#factFINAL assume true; 17686#factEXIT >#66#return; 17689#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17801#factFINAL assume true; 17429#factEXIT >#78#return; 17431#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; 17654#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 17653#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 17402#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 17302#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 17303#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 17395#L42-3 [2023-02-15 14:15:30,047 INFO L750 eck$LassoCheckResult]: Loop: 17395#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 17364#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; 17342#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17355#$Ultimate##0 ~n := #in~n; 17359#L25 assume !(~n <= 0); 17360#L26 call #t~ret0 := fact(~n - 1);< 17373#$Ultimate##0 ~n := #in~n; 17390#L25 assume !(~n <= 0); 17381#L26 call #t~ret0 := fact(~n - 1);< 17388#$Ultimate##0 ~n := #in~n; 17392#L25 assume ~n <= 0;#res := 1; 17394#factFINAL assume true; 17393#factEXIT >#66#return; 17383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17387#factFINAL assume true; 17380#factEXIT >#66#return; 17378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17356#factFINAL assume true; 17357#factEXIT >#68#return; 17343#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 17355#$Ultimate##0 ~n := #in~n; 17359#L25 assume ~n <= 0;#res := 1; 17358#factFINAL assume true; 17353#factEXIT >#70#return; 17340#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 17352#$Ultimate##0 ~n := #in~n; 17375#L25 assume !(~n <= 0); 17360#L26 call #t~ret0 := fact(~n - 1);< 17373#$Ultimate##0 ~n := #in~n; 17391#L25 assume ~n <= 0;#res := 1; 17377#factFINAL assume true; 17369#factEXIT >#66#return; 17367#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17365#factFINAL assume true; 17338#factEXIT >#72#return; 17350#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; 17376#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 17374#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 17368#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 17366#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; 17349#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17352#$Ultimate##0 ~n := #in~n; 17375#L25 assume !(~n <= 0); 17360#L26 call #t~ret0 := fact(~n - 1);< 17373#$Ultimate##0 ~n := #in~n; 17390#L25 assume !(~n <= 0); 17381#L26 call #t~ret0 := fact(~n - 1);< 17388#$Ultimate##0 ~n := #in~n; 17392#L25 assume ~n <= 0;#res := 1; 17394#factFINAL assume true; 17393#factEXIT >#66#return; 17383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17387#factFINAL assume true; 17380#factEXIT >#66#return; 17378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17356#factFINAL assume true; 17357#factEXIT >#68#return; 17345#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 17355#$Ultimate##0 ~n := #in~n; 17359#L25 assume !(~n <= 0); 17360#L26 call #t~ret0 := fact(~n - 1);< 17373#$Ultimate##0 ~n := #in~n; 17391#L25 assume ~n <= 0;#res := 1; 17377#factFINAL assume true; 17369#factEXIT >#66#return; 17367#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17365#factFINAL assume true; 17338#factEXIT >#70#return; 17346#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 17355#$Ultimate##0 ~n := #in~n; 17359#L25 assume ~n <= 0;#res := 1; 17358#factFINAL assume true; 17353#factEXIT >#72#return; 17354#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; 17363#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 17362#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 17361#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 17334#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; 17347#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17352#$Ultimate##0 ~n := #in~n; 17375#L25 assume !(~n <= 0); 17360#L26 call #t~ret0 := fact(~n - 1);< 17373#$Ultimate##0 ~n := #in~n; 17390#L25 assume !(~n <= 0); 17381#L26 call #t~ret0 := fact(~n - 1);< 17388#$Ultimate##0 ~n := #in~n; 17392#L25 assume ~n <= 0;#res := 1; 17394#factFINAL assume true; 17393#factEXIT >#66#return; 17383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17387#factFINAL assume true; 17380#factEXIT >#66#return; 17378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17356#factFINAL assume true; 17357#factEXIT >#74#return; 17344#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 17355#$Ultimate##0 ~n := #in~n; 17359#L25 assume ~n <= 0;#res := 1; 17358#factFINAL assume true; 17353#factEXIT >#76#return; 17339#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 17352#$Ultimate##0 ~n := #in~n; 17375#L25 assume !(~n <= 0); 17360#L26 call #t~ret0 := fact(~n - 1);< 17373#$Ultimate##0 ~n := #in~n; 17391#L25 assume ~n <= 0;#res := 1; 17377#factFINAL assume true; 17369#factEXIT >#66#return; 17367#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17365#factFINAL assume true; 17338#factEXIT >#78#return; 17337#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; 17336#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 17335#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 17333#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 17300#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 17301#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 17395#L42-3 [2023-02-15 14:15:30,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:30,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 2 times [2023-02-15 14:15:30,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:30,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234993259] [2023-02-15 14:15:30,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:30,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:30,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:15:30,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406451489] [2023-02-15 14:15:30,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 14:15:30,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:30,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:30,057 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:30,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2023-02-15 14:15:30,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 14:15:30,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 14:15:30,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:30,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:30,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:30,144 INFO L85 PathProgramCache]: Analyzing trace with hash 386087323, now seen corresponding path program 4 times [2023-02-15 14:15:30,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:30,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379895326] [2023-02-15 14:15:30,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:30,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:30,150 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:15:30,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035269512] [2023-02-15 14:15:30,151 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 14:15:30,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:30,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:30,153 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:30,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2023-02-15 14:15:30,233 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 14:15:30,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:30,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 14:15:30,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:30,309 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 14:15:30,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:30,631 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 14:15:30,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:30,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379895326] [2023-02-15 14:15:30,631 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 14:15:30,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035269512] [2023-02-15 14:15:30,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035269512] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:30,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 14:15:30,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2023-02-15 14:15:30,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128984524] [2023-02-15 14:15:30,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:30,632 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:15:30,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:30,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 14:15:30,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-02-15 14:15:30,633 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 14:15:30,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:30,952 INFO L93 Difference]: Finished difference Result 1212 states and 1617 transitions. [2023-02-15 14:15:30,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1212 states and 1617 transitions. [2023-02-15 14:15:30,960 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 151 [2023-02-15 14:15:30,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1212 states to 1193 states and 1594 transitions. [2023-02-15 14:15:30,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 412 [2023-02-15 14:15:30,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 412 [2023-02-15 14:15:30,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1193 states and 1594 transitions. [2023-02-15 14:15:30,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:30,969 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1193 states and 1594 transitions. [2023-02-15 14:15:30,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states and 1594 transitions. [2023-02-15 14:15:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 798. [2023-02-15 14:15:30,986 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 14:15:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1113 transitions. [2023-02-15 14:15:30,989 INFO L240 hiAutomatonCegarLoop]: Abstraction has 798 states and 1113 transitions. [2023-02-15 14:15:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 14:15:30,990 INFO L428 stractBuchiCegarLoop]: Abstraction has 798 states and 1113 transitions. [2023-02-15 14:15:30,990 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-02-15 14:15:30,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 798 states and 1113 transitions. [2023-02-15 14:15:30,994 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 83 [2023-02-15 14:15:30,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:30,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:30,995 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 14:15:30,995 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 14:15:30,995 INFO L748 eck$LassoCheckResult]: Stem: 19959#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 19907#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; 19908#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 19929#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; 19960#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 20106#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 19932#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; 20107#L25 assume ~n <= 0;#res := 1; 20105#factFINAL assume true; 20102#factEXIT >#68#return; 19944#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 19950#$Ultimate##0 ~n := #in~n; 19943#L25 assume ~n <= 0;#res := 1; 19945#factFINAL assume true; 20255#factEXIT >#70#return; 19895#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 19896#$Ultimate##0 ~n := #in~n; 20197#L25 assume ~n <= 0;#res := 1; 20196#factFINAL assume true; 20195#factEXIT >#72#return; 20194#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; 20193#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 20192#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 20191#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 20098#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; 20099#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 20189#$Ultimate##0 ~n := #in~n; 20206#L25 assume !(~n <= 0); 20119#L26 call #t~ret0 := fact(~n - 1);< 20120#$Ultimate##0 ~n := #in~n; 20222#L25 assume !(~n <= 0); 20219#L26 call #t~ret0 := fact(~n - 1);< 20220#$Ultimate##0 ~n := #in~n; 20224#L25 assume ~n <= 0;#res := 1; 20236#factFINAL assume true; 20235#factEXIT >#66#return; 20229#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20230#factFINAL assume true; 20233#factEXIT >#66#return; 20234#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20241#factFINAL assume true; 20240#factEXIT >#74#return; 20129#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 20132#$Ultimate##0 ~n := #in~n; 20257#L25 assume ~n <= 0;#res := 1; 20256#factFINAL assume true; 20127#factEXIT >#76#return; 19914#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 20169#$Ultimate##0 ~n := #in~n; 20170#L25 assume !(~n <= 0); 19913#L26 call #t~ret0 := fact(~n - 1);< 19915#$Ultimate##0 ~n := #in~n; 20207#L25 assume !(~n <= 0); 20201#L26 call #t~ret0 := fact(~n - 1);< 20205#$Ultimate##0 ~n := #in~n; 20217#L25 assume ~n <= 0;#res := 1; 20216#factFINAL assume true; 20215#factEXIT >#66#return; 20214#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20213#factFINAL assume true; 20212#factEXIT >#66#return; 19935#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19937#factFINAL assume true; 20249#factEXIT >#78#return; 20101#L30-8 [2023-02-15 14:15:30,995 INFO L750 eck$LassoCheckResult]: Loop: 20101#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; 20248#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 20246#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 20244#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 20190#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; 20125#L25 assume !(~n <= 0); 20200#L26 call #t~ret0 := fact(~n - 1);< 20203#$Ultimate##0 ~n := #in~n; 20207#L25 assume !(~n <= 0); 20201#L26 call #t~ret0 := fact(~n - 1);< 20205#$Ultimate##0 ~n := #in~n; 20207#L25 assume !(~n <= 0); 20201#L26 call #t~ret0 := fact(~n - 1);< 20205#$Ultimate##0 ~n := #in~n; 20207#L25 assume !(~n <= 0); 20201#L26 call #t~ret0 := fact(~n - 1);< 20205#$Ultimate##0 ~n := #in~n; 20217#L25 assume ~n <= 0;#res := 1; 20216#factFINAL assume true; 20215#factEXIT >#66#return; 20214#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20213#factFINAL assume true; 20212#factEXIT >#66#return; 20211#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20210#factFINAL assume true; 20208#factEXIT >#66#return; 20202#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20204#factFINAL assume true; 20199#factEXIT >#66#return; 20198#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20111#factFINAL assume true; 20100#factEXIT >#74#return; 19890#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 19953#$Ultimate##0 ~n := #in~n; 19954#L25 assume ~n <= 0;#res := 1; 19903#factFINAL assume true; 19889#factEXIT >#76#return; 19891#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 20112#$Ultimate##0 ~n := #in~n; 20122#L25 assume !(~n <= 0); 20123#L26 call #t~ret0 := fact(~n - 1);< 19915#$Ultimate##0 ~n := #in~n; 20207#L25 assume !(~n <= 0); 20201#L26 call #t~ret0 := fact(~n - 1);< 20205#$Ultimate##0 ~n := #in~n; 20207#L25 assume !(~n <= 0); 20201#L26 call #t~ret0 := fact(~n - 1);< 20205#$Ultimate##0 ~n := #in~n; 20207#L25 assume !(~n <= 0); 20201#L26 call #t~ret0 := fact(~n - 1);< 20205#$Ultimate##0 ~n := #in~n; 20217#L25 assume ~n <= 0;#res := 1; 20216#factFINAL assume true; 20215#factEXIT >#66#return; 20214#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20213#factFINAL assume true; 20212#factEXIT >#66#return; 20211#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20210#factFINAL assume true; 20208#factEXIT >#66#return; 20202#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20204#factFINAL assume true; 20199#factEXIT >#66#return; 20198#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20111#factFINAL assume true; 20100#factEXIT >#78#return; 20101#L30-8 [2023-02-15 14:15:30,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:30,996 INFO L85 PathProgramCache]: Analyzing trace with hash -341163101, now seen corresponding path program 1 times [2023-02-15 14:15:30,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:30,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293611737] [2023-02-15 14:15:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:30,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:31,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:15:31,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1380978604] [2023-02-15 14:15:31,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:31,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:31,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:31,009 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:31,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2023-02-15 14:15:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:31,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 14:15:31,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:31,132 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 14:15:31,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:31,283 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 14:15:31,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:31,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293611737] [2023-02-15 14:15:31,283 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 14:15:31,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380978604] [2023-02-15 14:15:31,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380978604] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:31,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 14:15:31,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2023-02-15 14:15:31,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879443703] [2023-02-15 14:15:31,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:31,284 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:31,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:31,284 INFO L85 PathProgramCache]: Analyzing trace with hash 857296756, now seen corresponding path program 2 times [2023-02-15 14:15:31,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:31,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984359710] [2023-02-15 14:15:31,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:31,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:31,288 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:15:31,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601688506] [2023-02-15 14:15:31,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 14:15:31,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:31,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:31,295 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:31,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2023-02-15 14:15:31,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 14:15:31,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 14:15:31,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:31,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:32,500 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:32,500 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:32,500 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:32,500 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:32,500 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:32,500 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:32,501 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:32,501 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:32,501 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2023-02-15 14:15:32,501 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:32,501 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:32,501 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 14:15:32,529 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 14:15:32,531 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 14:15:32,532 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 14:15:32,534 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 14:15:32,630 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:32,630 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:32,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:32,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:32,640 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 14:15:32,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:32,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:32,652 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 14:15:32,663 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 14:15:32,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:32,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:32,665 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 14:15:32,665 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 14:15:32,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:32,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:32,681 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:32,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:32,684 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:32,684 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:32,684 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:32,684 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:32,684 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:32,684 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:32,684 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:32,684 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:32,685 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2023-02-15 14:15:32,685 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:32,685 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:32,685 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 14:15:32,688 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 14:15:32,690 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 14:15:32,711 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 14:15:32,713 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 14:15:32,804 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:32,805 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:32,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:32,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:32,806 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 14:15:32,808 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 14:15:32,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 14:15:32,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:32,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:32,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:32,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:32,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:32,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:32,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:32,818 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:32,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2023-02-15 14:15:32,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:32,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:32,822 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:32,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2023-02-15 14:15:32,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:15:32,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:32,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:32,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:32,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:32,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:32,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:32,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:32,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:32,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:32,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:32,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:32,836 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:32,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2023-02-15 14:15:32,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 14:15:32,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:32,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:32,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:32,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:32,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:32,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:32,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:32,873 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:32,876 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:32,876 INFO L444 ModelExtractionUtils]: 8 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:15:32,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:32,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:32,883 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:32,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2023-02-15 14:15:32,885 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:32,885 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:32,885 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:32,885 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 14:15:32,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:32,889 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 14:15:32,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:33,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:33,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 14:15:33,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:33,522 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 14:15:33,523 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 14:15:33,523 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 798 states and 1113 transitions. cyclomatic complexity: 333 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 14:15:33,788 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 798 states and 1113 transitions. cyclomatic complexity: 333. 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 1508 states and 1986 transitions. Complement of second has 53 states. [2023-02-15 14:15:33,789 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 14:15:33,789 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 14:15:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 81 transitions. [2023-02-15 14:15:33,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 81 transitions. Stem has 66 letters. Loop has 68 letters. [2023-02-15 14:15:33,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:33,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 81 transitions. Stem has 134 letters. Loop has 68 letters. [2023-02-15 14:15:33,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:33,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 81 transitions. Stem has 66 letters. Loop has 136 letters. [2023-02-15 14:15:33,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:33,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1508 states and 1986 transitions. [2023-02-15 14:15:33,802 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 83 [2023-02-15 14:15:33,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1508 states to 1290 states and 1716 transitions. [2023-02-15 14:15:33,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 340 [2023-02-15 14:15:33,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2023-02-15 14:15:33,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1716 transitions. [2023-02-15 14:15:33,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:33,812 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1290 states and 1716 transitions. [2023-02-15 14:15:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1716 transitions. [2023-02-15 14:15:33,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1039. [2023-02-15 14:15:33,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 684 states have (on average 1.0833333333333333) internal successors, (741), 680 states have internal predecessors, (741), 212 states have call successors, (222), 115 states have call predecessors, (222), 143 states have return successors, (426), 243 states have call predecessors, (426), 212 states have call successors, (426) [2023-02-15 14:15:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1389 transitions. [2023-02-15 14:15:33,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1039 states and 1389 transitions. [2023-02-15 14:15:33,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:33,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 14:15:33,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-15 14:15:33,838 INFO L87 Difference]: Start difference. First operand 1039 states and 1389 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 14:15:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:34,043 INFO L93 Difference]: Finished difference Result 1162 states and 1582 transitions. [2023-02-15 14:15:34,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1162 states and 1582 transitions. [2023-02-15 14:15:34,051 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2023-02-15 14:15:34,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1162 states to 1132 states and 1546 transitions. [2023-02-15 14:15:34,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 328 [2023-02-15 14:15:34,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 328 [2023-02-15 14:15:34,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1132 states and 1546 transitions. [2023-02-15 14:15:34,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:34,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1132 states and 1546 transitions. [2023-02-15 14:15:34,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states and 1546 transitions. [2023-02-15 14:15:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 981. [2023-02-15 14:15:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 648 states have (on average 1.0817901234567902) internal successors, (701), 646 states have internal predecessors, (701), 200 states have call successors, (208), 105 states have call predecessors, (208), 133 states have return successors, (400), 229 states have call predecessors, (400), 200 states have call successors, (400) [2023-02-15 14:15:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1309 transitions. [2023-02-15 14:15:34,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 981 states and 1309 transitions. [2023-02-15 14:15:34,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 14:15:34,110 INFO L428 stractBuchiCegarLoop]: Abstraction has 981 states and 1309 transitions. [2023-02-15 14:15:34,110 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-02-15 14:15:34,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 981 states and 1309 transitions. [2023-02-15 14:15:34,114 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 83 [2023-02-15 14:15:34,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:34,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:34,115 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 14:15:34,115 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 14:15:34,115 INFO L748 eck$LassoCheckResult]: Stem: 25371#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 25315#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; 25316#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 25338#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; 25325#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 25326#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 25520#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; 25311#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 25312#$Ultimate##0 ~n := #in~n; 25556#L25 assume ~n <= 0;#res := 1; 25550#factFINAL assume true; 25542#factEXIT >#68#return; 25356#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 25357#$Ultimate##0 ~n := #in~n; 25522#L25 assume ~n <= 0;#res := 1; 25521#factFINAL assume true; 25519#factEXIT >#70#return; 25302#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 25303#$Ultimate##0 ~n := #in~n; 25586#L25 assume ~n <= 0;#res := 1; 25583#factFINAL assume true; 25579#factEXIT >#72#return; 25578#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; 25566#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 25554#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 25549#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 25539#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; 25537#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 25538#$Ultimate##0 ~n := #in~n; 25548#L25 assume !(~n <= 0); 25546#L26 call #t~ret0 := fact(~n - 1);< 25547#$Ultimate##0 ~n := #in~n; 25565#L25 assume ~n <= 0;#res := 1; 25553#factFINAL assume true; 25545#factEXIT >#66#return; 25544#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25543#factFINAL assume true; 25536#factEXIT >#74#return; 25364#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 25366#$Ultimate##0 ~n := #in~n; 25597#L25 assume ~n <= 0;#res := 1; 25595#factFINAL assume true; 25593#factEXIT >#76#return; 25322#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 25372#$Ultimate##0 ~n := #in~n; 25596#L25 assume !(~n <= 0); 25321#L26 call #t~ret0 := fact(~n - 1);< 25323#$Ultimate##0 ~n := #in~n; 25360#L25 assume ~n <= 0;#res := 1; 25880#factFINAL assume true; 25855#factEXIT >#66#return; 25853#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25850#factFINAL assume true; 25832#factEXIT >#78#return; 25829#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; 25830#binomialCoefficient_returnLabel#2 [2023-02-15 14:15:34,115 INFO L750 eck$LassoCheckResult]: Loop: 25830#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 25369#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 25370#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 25534#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; 25292#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 25293#$Ultimate##0 ~n := #in~n; 25594#L25 assume !(~n <= 0); 25561#L26 call #t~ret0 := fact(~n - 1);< 25564#$Ultimate##0 ~n := #in~n; 25571#L25 assume !(~n <= 0); 25558#L26 call #t~ret0 := fact(~n - 1);< 25568#$Ultimate##0 ~n := #in~n; 25571#L25 assume !(~n <= 0); 25558#L26 call #t~ret0 := fact(~n - 1);< 25568#$Ultimate##0 ~n := #in~n; 25571#L25 assume !(~n <= 0); 25558#L26 call #t~ret0 := fact(~n - 1);< 25568#$Ultimate##0 ~n := #in~n; 25571#L25 assume !(~n <= 0); 25558#L26 call #t~ret0 := fact(~n - 1);< 25568#$Ultimate##0 ~n := #in~n; 25573#L25 assume ~n <= 0;#res := 1; 25602#factFINAL assume true; 25601#factEXIT >#66#return; 25600#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25599#factFINAL assume true; 25598#factEXIT >#66#return; 25592#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25591#factFINAL assume true; 25590#factEXIT >#66#return; 25587#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25584#factFINAL assume true; 25580#factEXIT >#66#return; 25562#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25567#factFINAL assume true; 25557#factEXIT >#66#return; 25552#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25529#factFINAL assume true; 25525#factEXIT >#74#return; 25528#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 25532#$Ultimate##0 ~n := #in~n; 25535#L25 assume ~n <= 0;#res := 1; 25533#factFINAL assume true; 25531#factEXIT >#76#return; 25526#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 25530#$Ultimate##0 ~n := #in~n; 25588#L25 assume !(~n <= 0); 25560#L26 call #t~ret0 := fact(~n - 1);< 25564#$Ultimate##0 ~n := #in~n; 25571#L25 assume !(~n <= 0); 25558#L26 call #t~ret0 := fact(~n - 1);< 25568#$Ultimate##0 ~n := #in~n; 25571#L25 assume !(~n <= 0); 25558#L26 call #t~ret0 := fact(~n - 1);< 25568#$Ultimate##0 ~n := #in~n; 25571#L25 assume !(~n <= 0); 25558#L26 call #t~ret0 := fact(~n - 1);< 25568#$Ultimate##0 ~n := #in~n; 25571#L25 assume !(~n <= 0); 25558#L26 call #t~ret0 := fact(~n - 1);< 25568#$Ultimate##0 ~n := #in~n; 25573#L25 assume ~n <= 0;#res := 1; 25602#factFINAL assume true; 25601#factEXIT >#66#return; 25600#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25599#factFINAL assume true; 25598#factEXIT >#66#return; 25592#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25591#factFINAL assume true; 25590#factEXIT >#66#return; 25587#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25584#factFINAL assume true; 25580#factEXIT >#66#return; 25562#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25567#factFINAL assume true; 25557#factEXIT >#66#return; 25552#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25529#factFINAL assume true; 25525#factEXIT >#78#return; 25527#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; 25830#binomialCoefficient_returnLabel#2 [2023-02-15 14:15:34,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:34,116 INFO L85 PathProgramCache]: Analyzing trace with hash 970322272, now seen corresponding path program 1 times [2023-02-15 14:15:34,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:34,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006982245] [2023-02-15 14:15:34,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:34,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:34,122 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:15:34,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [11772412] [2023-02-15 14:15:34,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:34,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:34,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:34,124 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 14:15:34,147 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 14:15:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:34,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:34,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:34,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1988608930, now seen corresponding path program 3 times [2023-02-15 14:15:34,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:34,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709255151] [2023-02-15 14:15:34,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:34,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:34,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:15:34,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857023406] [2023-02-15 14:15:34,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 14:15:34,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:34,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:34,217 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 14:15:34,240 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 14:15:34,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2023-02-15 14:15:34,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 14:15:34,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:34,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:34,379 INFO L85 PathProgramCache]: Analyzing trace with hash -666167363, now seen corresponding path program 2 times [2023-02-15 14:15:34,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:34,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414528819] [2023-02-15 14:15:34,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:34,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:34,386 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 14:15:34,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [155056465] [2023-02-15 14:15:34,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 14:15:34,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:34,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:34,390 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 14:15:34,390 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 14:15:34,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 14:15:34,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:34,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:15:34,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:34,534 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 14:15:34,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:34,875 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 14:15:34,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:34,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414528819] [2023-02-15 14:15:34,876 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 14:15:34,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155056465] [2023-02-15 14:15:34,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155056465] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:34,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 14:15:34,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2023-02-15 14:15:34,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907915315] [2023-02-15 14:15:34,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:52,663 WARN L233 SmtUtils]: Spent 14.43s 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 14:15:58,518 WARN L233 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-15 14:16:07,957 WARN L233 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 43 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)