./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 f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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 7271d13f0b7b365fd7ecc81e9b65f9e103181ef3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: UNKNOWN during nested interpolation. I don't know how to continue --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:30:20,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:30:20,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:30:20,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:30:20,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:30:20,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:30:20,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:30:20,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:30:20,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:30:20,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:30:20,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:30:20,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:30:20,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:30:20,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:30:20,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:30:20,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:30:20,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:30:20,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:30:20,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:30:20,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:30:20,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:30:20,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:30:20,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:30:20,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:30:20,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:30:20,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:30:20,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:30:20,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:30:20,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:30:20,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:30:20,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:30:20,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:30:20,429 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:30:20,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:30:20,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:30:20,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:30:20,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:30:20,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:30:20,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:30:20,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:30:20,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:30:20,438 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:30:20,468 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:30:20,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:30:20,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:30:20,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:30:20,473 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:30:20,473 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:30:20,473 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:30:20,474 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:30:20,474 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:30:20,474 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:30:20,475 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:30:20,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:30:20,476 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:30:20,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:30:20,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:30:20,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:30:20,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:30:20,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:30:20,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:30:20,478 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:30:20,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:30:20,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:30:20,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:30:20,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:30:20,479 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:30:20,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:30:20,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:30:20,480 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:30:20,480 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:30:20,482 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:30:20,482 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.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 -> 7271d13f0b7b365fd7ecc81e9b65f9e103181ef3 [2019-11-28 20:30:20,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:30:20,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:30:20,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:30:20,811 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:30:20,813 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:30:20,814 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Binomial.c [2019-11-28 20:30:20,884 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34927067/11809023076d4b99b01b9c5817f7113e/FLAGe30655530 [2019-11-28 20:30:21,318 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:30:21,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2019-11-28 20:30:21,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34927067/11809023076d4b99b01b9c5817f7113e/FLAGe30655530 [2019-11-28 20:30:21,847 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34927067/11809023076d4b99b01b9c5817f7113e [2019-11-28 20:30:21,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:30:21,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:30:21,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:30:21,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:30:21,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:30:21,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:30:21" (1/1) ... [2019-11-28 20:30:21,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee01756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:21, skipping insertion in model container [2019-11-28 20:30:21,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:30:21" (1/1) ... [2019-11-28 20:30:21,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:30:21,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:30:22,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:30:22,072 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:30:22,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:30:22,104 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:30:22,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:22 WrapperNode [2019-11-28 20:30:22,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:30:22,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:30:22,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:30:22,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:30:22,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:22" (1/1) ... [2019-11-28 20:30:22,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:22" (1/1) ... [2019-11-28 20:30:22,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:30:22,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:30:22,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:30:22,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:30:22,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:22" (1/1) ... [2019-11-28 20:30:22,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:22" (1/1) ... [2019-11-28 20:30:22,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:22" (1/1) ... [2019-11-28 20:30:22,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:22" (1/1) ... [2019-11-28 20:30:22,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:22" (1/1) ... [2019-11-28 20:30:22,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:22" (1/1) ... [2019-11-28 20:30:22,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:22" (1/1) ... [2019-11-28 20:30:22,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:30:22,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:30:22,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:30:22,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:30:22,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:22,300 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2019-11-28 20:30:22,301 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2019-11-28 20:30:22,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:30:22,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:30:22,541 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:30:22,542 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-28 20:30:22,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:30:22 BoogieIcfgContainer [2019-11-28 20:30:22,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:30:22,545 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:30:22,545 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:30:22,549 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:30:22,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:30:22,551 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:30:21" (1/3) ... [2019-11-28 20:30:22,552 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31bc6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:30:22, skipping insertion in model container [2019-11-28 20:30:22,552 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:30:22,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:22" (2/3) ... [2019-11-28 20:30:22,553 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31bc6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:30:22, skipping insertion in model container [2019-11-28 20:30:22,553 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:30:22,553 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:30:22" (3/3) ... [2019-11-28 20:30:22,555 INFO L371 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2019-11-28 20:30:22,618 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:30:22,619 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:30:22,619 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:30:22,619 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:30:22,619 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:30:22,620 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:30:22,620 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:30:22,620 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:30:22,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-28 20:30:22,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-28 20:30:22,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:22,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:22,684 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:30:22,684 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:30:22,684 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:30:22,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-28 20:30:22,688 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-28 20:30:22,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:22,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:22,688 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:30:22,689 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:30:22,695 INFO L794 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 27#L35true assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 3#L38true assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 14#L41-3true [2019-11-28 20:30:22,696 INFO L796 eck$LassoCheckResult]: Loop: 14#L41-3true assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 5#L42-3true assume !(main_~k~0 <= main_~x~0); 16#L41-2true main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 14#L41-3true [2019-11-28 20:30:22,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:22,701 INFO L82 PathProgramCache]: Analyzing trace with hash 38893, now seen corresponding path program 1 times [2019-11-28 20:30:22,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:22,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694659600] [2019-11-28 20:30:22,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:22,812 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:22,813 INFO L82 PathProgramCache]: Analyzing trace with hash 56819, now seen corresponding path program 1 times [2019-11-28 20:30:22,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:22,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805206685] [2019-11-28 20:30:22,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:22,828 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:22,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:22,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1158688391, now seen corresponding path program 1 times [2019-11-28 20:30:22,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:22,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530260524] [2019-11-28 20:30:22,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:22,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530260524] [2019-11-28 20:30:22,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:30:22,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:30:22,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209479171] [2019-11-28 20:30:22,973 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:22,974 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:22,974 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:22,974 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:22,975 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:30:22,975 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:22,975 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:22,975 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:22,975 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2019-11-28 20:30:22,976 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:22,976 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:22,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:23,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:23,081 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:23,081 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:23,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:23,094 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:23,104 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:30:23,105 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:23,118 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:23,119 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:23,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:30:23,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:30:23,312 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:30:23,315 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:23,315 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:23,315 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:23,315 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:23,315 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:30:23,315 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:23,316 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:23,316 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:23,316 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2019-11-28 20:30:23,316 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:23,316 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:23,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:23,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:23,401 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:23,407 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:23,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:23,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:23,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:23,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:23,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:23,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:23,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:23,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:23,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:23,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:23,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:23,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:23,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:23,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:23,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:23,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:23,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:23,461 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:30:23,473 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 20:30:23,473 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:23,496 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:30:23,497 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:30:23,497 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:30:23,498 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-28 20:30:23,507 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:23,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:23,563 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:30:23,565 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:23,579 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:30:23,581 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:23,645 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:30:23,646 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 4 states. [2019-11-28 20:30:23,777 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 4 states. Result 72 states and 105 transitions. Complement of second has 11 states. [2019-11-28 20:30:23,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:30:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:30:23,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2019-11-28 20:30:23,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-28 20:30:23,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:23,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-28 20:30:23,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:23,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-28 20:30:23,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:23,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 105 transitions. [2019-11-28 20:30:23,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-28 20:30:23,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 32 states and 47 transitions. [2019-11-28 20:30:23,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 20:30:23,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-28 20:30:23,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 47 transitions. [2019-11-28 20:30:23,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:30:23,807 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-11-28 20:30:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 47 transitions. [2019-11-28 20:30:23,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-11-28 20:30:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 20:30:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2019-11-28 20:30:23,847 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 41 transitions. [2019-11-28 20:30:23,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:23,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:30:23,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:30:23,853 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 4 states. [2019-11-28 20:30:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:23,928 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-11-28 20:30:23,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:30:23,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2019-11-28 20:30:23,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-28 20:30:23,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 36 transitions. [2019-11-28 20:30:23,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-28 20:30:23,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 20:30:23,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-28 20:30:23,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:30:23,934 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-28 20:30:23,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-28 20:30:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-28 20:30:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 20:30:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-11-28 20:30:23,939 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 20:30:23,939 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 20:30:23,939 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:30:23,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-11-28 20:30:23,941 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-28 20:30:23,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:23,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:23,942 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:30:23,942 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:23,943 INFO L794 eck$LassoCheckResult]: Stem: 234#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 235#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 217#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 215#L41-3 [2019-11-28 20:30:23,943 INFO L796 eck$LassoCheckResult]: Loop: 215#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 216#L42-3 assume !!(main_~k~0 <= main_~x~0); 229#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 225#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 228#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 236#factFINAL assume true; 218#factEXIT >#67#return; 222#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 228#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 236#factFINAL assume true; 218#factEXIT >#69#return; 224#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 228#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 236#factFINAL assume true; 218#factEXIT >#71#return; 214#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2;havoc binomialCoefficient_#t~ret3; 212#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 213#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 231#L42-3 assume !(main_~k~0 <= main_~x~0); 230#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 215#L41-3 [2019-11-28 20:30:23,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:23,944 INFO L82 PathProgramCache]: Analyzing trace with hash 38893, now seen corresponding path program 2 times [2019-11-28 20:30:23,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:23,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573399367] [2019-11-28 20:30:23,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:23,955 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:23,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:23,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1214025381, now seen corresponding path program 1 times [2019-11-28 20:30:23,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:23,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027781176] [2019-11-28 20:30:23,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:23,969 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:30:23,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1261428437] [2019-11-28 20:30:23,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:30:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:24,032 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:24,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:24,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2062430919, now seen corresponding path program 1 times [2019-11-28 20:30:24,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:24,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602601396] [2019-11-28 20:30:24,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:24,066 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:30:24,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1182923333] [2019-11-28 20:30:24,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:30:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:24,162 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:24,481 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-28 20:30:24,629 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:24,630 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:24,630 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:24,630 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:24,630 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:30:24,630 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:24,630 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:24,631 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:24,632 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2019-11-28 20:30:24,632 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:24,632 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:24,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:24,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:24,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:24,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:24,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:24,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:24,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:24,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:24,808 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:24,808 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:24,816 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:24,816 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:24,821 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:30:24,822 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:24,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:24,835 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:24,842 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:30:24,843 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:24,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:24,859 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:24,868 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:30:24,869 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res=1} Honda state: {ULTIMATE.start_binomialCoefficient_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:24,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:24,888 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:24,895 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:30:24,898 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:24,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:24,923 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:24,928 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:30:24,929 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:24,945 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:24,945 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:24,950 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:30:24,950 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9=0} Honda state: {ULTIMATE.start_main_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:24,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:24,967 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:24,971 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:30:24,971 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:24,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:24,989 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:25,015 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:30:25,016 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:25,603 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:30:25,607 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:25,607 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:25,607 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:25,607 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:25,607 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:30:25,607 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:25,608 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:25,608 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:25,608 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2019-11-28 20:30:25,608 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:25,608 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:25,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:25,818 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:25,819 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:25,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:25,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:25,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:25,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:25,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:25,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:25,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:25,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:25,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:25,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:25,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:25,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:25,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:25,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:25,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:25,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:25,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:25,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:25,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:25,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:25,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:25,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:25,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:25,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:25,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:25,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:25,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:25,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:25,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:25,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:25,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:25,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:25,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:25,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:25,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:25,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:25,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:25,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:25,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:25,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:25,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:25,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:25,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:25,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:25,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:25,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:25,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:25,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:25,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:25,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:25,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:25,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:25,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:25,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:25,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:25,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:25,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:25,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:25,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:25,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:25,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:25,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:25,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:25,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:25,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:25,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:25,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:25,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:25,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:25,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:25,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:25,988 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:30:25,997 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 20:30:25,997 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:26,007 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:30:26,008 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:30:26,008 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:30:26,008 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:26,011 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:30:26,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:26,038 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:30:26,038 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:26,070 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:30:26,072 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 20:30:26,161 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-28 20:30:26,161 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 11 Second operand 8 states. [2019-11-28 20:30:26,506 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 116 states and 181 transitions. Complement of second has 26 states. [2019-11-28 20:30:26,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-28 20:30:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:30:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2019-11-28 20:30:26,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 3 letters. Loop has 23 letters. [2019-11-28 20:30:26,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:26,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 26 letters. Loop has 23 letters. [2019-11-28 20:30:26,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:26,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 3 letters. Loop has 46 letters. [2019-11-28 20:30:26,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:26,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 181 transitions. [2019-11-28 20:30:26,518 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2019-11-28 20:30:26,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 115 states and 180 transitions. [2019-11-28 20:30:26,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-28 20:30:26,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-28 20:30:26,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 180 transitions. [2019-11-28 20:30:26,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:30:26,525 INFO L688 BuchiCegarLoop]: Abstraction has 115 states and 180 transitions. [2019-11-28 20:30:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 180 transitions. [2019-11-28 20:30:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2019-11-28 20:30:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 20:30:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2019-11-28 20:30:26,546 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 153 transitions. [2019-11-28 20:30:26,546 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 153 transitions. [2019-11-28 20:30:26,546 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:30:26,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 153 transitions. [2019-11-28 20:30:26,549 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2019-11-28 20:30:26,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:26,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:26,551 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:30:26,551 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:26,551 INFO L794 eck$LassoCheckResult]: Stem: 536#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 537#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 490#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 491#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 493#L42-3 [2019-11-28 20:30:26,551 INFO L796 eck$LassoCheckResult]: Loop: 493#L42-3 assume !!(main_~k~0 <= main_~x~0); 514#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 538#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 567#factENTRY ~n := #in~n; 572#L25 assume !(~n <= 0); 497#L26 call #t~ret0 := fact(~n - 1);< 526#factENTRY ~n := #in~n; 527#L25 assume ~n <= 0;#res := 1; 544#factFINAL assume true; 496#factEXIT >#65#return; 500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 570#factFINAL assume true; 568#factEXIT >#67#return; 563#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 567#factENTRY ~n := #in~n; 572#L25 assume ~n <= 0;#res := 1; 573#factFINAL assume true; 562#factEXIT >#69#return; 565#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 567#factENTRY ~n := #in~n; 572#L25 assume ~n <= 0;#res := 1; 573#factFINAL assume true; 562#factEXIT >#71#return; 561#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2;havoc binomialCoefficient_#t~ret3; 559#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 557#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 556#L42-3 assume !(main_~k~0 <= main_~x~0); 516#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 492#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 493#L42-3 [2019-11-28 20:30:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:26,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 1 times [2019-11-28 20:30:26,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:26,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702979234] [2019-11-28 20:30:26,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:26,567 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:26,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:26,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1320440455, now seen corresponding path program 1 times [2019-11-28 20:30:26,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:26,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549294094] [2019-11-28 20:30:26,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:26,580 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:30:26,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987436454] [2019-11-28 20:30:26,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:30:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:26,627 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:30:26,631 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 20:30:26,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549294094] [2019-11-28 20:30:26,684 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 20:30:26,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987436454] [2019-11-28 20:30:26,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:30:26,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-28 20:30:26,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952392423] [2019-11-28 20:30:26,686 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:30:26,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:26,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:30:26,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:30:26,687 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. cyclomatic complexity: 54 Second operand 8 states. [2019-11-28 20:30:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:27,021 INFO L93 Difference]: Finished difference Result 192 states and 293 transitions. [2019-11-28 20:30:27,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:30:27,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 293 transitions. [2019-11-28 20:30:27,028 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2019-11-28 20:30:27,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 192 states and 293 transitions. [2019-11-28 20:30:27,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2019-11-28 20:30:27,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2019-11-28 20:30:27,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 293 transitions. [2019-11-28 20:30:27,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:30:27,037 INFO L688 BuchiCegarLoop]: Abstraction has 192 states and 293 transitions. [2019-11-28 20:30:27,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 293 transitions. [2019-11-28 20:30:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 128. [2019-11-28 20:30:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 20:30:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2019-11-28 20:30:27,063 INFO L711 BuchiCegarLoop]: Abstraction has 128 states and 203 transitions. [2019-11-28 20:30:27,063 INFO L591 BuchiCegarLoop]: Abstraction has 128 states and 203 transitions. [2019-11-28 20:30:27,063 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:30:27,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 203 transitions. [2019-11-28 20:30:27,066 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2019-11-28 20:30:27,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:27,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:27,067 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:30:27,067 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:27,068 INFO L794 eck$LassoCheckResult]: Stem: 937#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 938#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 892#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 893#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 889#L42-3 [2019-11-28 20:30:27,068 INFO L796 eck$LassoCheckResult]: Loop: 889#L42-3 assume !!(main_~k~0 <= main_~x~0); 939#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 940#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 981#factENTRY ~n := #in~n; 983#L25 assume !(~n <= 0); 896#L26 call #t~ret0 := fact(~n - 1);< 925#factENTRY ~n := #in~n; 926#L25 assume ~n <= 0;#res := 1; 946#factFINAL assume true; 894#factEXIT >#65#return; 899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979#factFINAL assume true; 980#factEXIT >#67#return; 973#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 981#factENTRY ~n := #in~n; 983#L25 assume ~n <= 0;#res := 1; 982#factFINAL assume true; 971#factEXIT >#69#return; 977#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 978#factENTRY ~n := #in~n; 985#L25 assume !(~n <= 0); 896#L26 call #t~ret0 := fact(~n - 1);< 925#factENTRY ~n := #in~n; 926#L25 assume ~n <= 0;#res := 1; 946#factFINAL assume true; 894#factEXIT >#65#return; 899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979#factFINAL assume true; 980#factEXIT >#71#return; 970#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2;havoc binomialCoefficient_#t~ret3; 968#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 966#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 965#L42-3 assume !(main_~k~0 <= main_~x~0); 915#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 888#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 889#L42-3 [2019-11-28 20:30:27,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:27,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 2 times [2019-11-28 20:30:27,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:27,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12882592] [2019-11-28 20:30:27,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:27,078 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:27,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:27,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1015509379, now seen corresponding path program 2 times [2019-11-28 20:30:27,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:27,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951600415] [2019-11-28 20:30:27,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:27,085 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:30:27,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611987776] [2019-11-28 20:30:27,085 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:30:27,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:30:27,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:30:27,143 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:30:27,147 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-28 20:30:27,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951600415] [2019-11-28 20:30:27,274 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 20:30:27,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611987776] [2019-11-28 20:30:27,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:30:27,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-11-28 20:30:27,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997935740] [2019-11-28 20:30:27,276 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:30:27,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:27,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:30:27,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:30:27,278 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. cyclomatic complexity: 80 Second operand 12 states. [2019-11-28 20:30:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:27,810 INFO L93 Difference]: Finished difference Result 198 states and 313 transitions. [2019-11-28 20:30:27,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:30:27,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 313 transitions. [2019-11-28 20:30:27,817 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 68 [2019-11-28 20:30:27,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 192 states and 307 transitions. [2019-11-28 20:30:27,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2019-11-28 20:30:27,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2019-11-28 20:30:27,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 307 transitions. [2019-11-28 20:30:27,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:30:27,824 INFO L688 BuchiCegarLoop]: Abstraction has 192 states and 307 transitions. [2019-11-28 20:30:27,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 307 transitions. [2019-11-28 20:30:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2019-11-28 20:30:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-28 20:30:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 247 transitions. [2019-11-28 20:30:27,844 INFO L711 BuchiCegarLoop]: Abstraction has 156 states and 247 transitions. [2019-11-28 20:30:27,844 INFO L591 BuchiCegarLoop]: Abstraction has 156 states and 247 transitions. [2019-11-28 20:30:27,844 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:30:27,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 247 transitions. [2019-11-28 20:30:27,846 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2019-11-28 20:30:27,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:27,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:27,848 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:30:27,848 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:27,848 INFO L794 eck$LassoCheckResult]: Stem: 1391#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 1392#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 1347#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 1348#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 1350#L42-3 [2019-11-28 20:30:27,848 INFO L796 eck$LassoCheckResult]: Loop: 1350#L42-3 assume !!(main_~k~0 <= main_~x~0); 1412#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 1414#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 1459#factENTRY ~n := #in~n; 1466#L25 assume !(~n <= 0); 1359#L26 call #t~ret0 := fact(~n - 1);< 1385#factENTRY ~n := #in~n; 1386#L25 assume ~n <= 0;#res := 1; 1407#factFINAL assume true; 1357#factEXIT >#65#return; 1363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462#factFINAL assume true; 1460#factEXIT >#67#return; 1454#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 1459#factENTRY ~n := #in~n; 1466#L25 assume !(~n <= 0); 1359#L26 call #t~ret0 := fact(~n - 1);< 1385#factENTRY ~n := #in~n; 1386#L25 assume ~n <= 0;#res := 1; 1407#factFINAL assume true; 1357#factEXIT >#65#return; 1363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462#factFINAL assume true; 1460#factEXIT >#69#return; 1455#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 1459#factENTRY ~n := #in~n; 1466#L25 assume !(~n <= 0); 1359#L26 call #t~ret0 := fact(~n - 1);< 1385#factENTRY ~n := #in~n; 1386#L25 assume ~n <= 0;#res := 1; 1407#factFINAL assume true; 1357#factEXIT >#65#return; 1363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462#factFINAL assume true; 1460#factEXIT >#71#return; 1458#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2;havoc binomialCoefficient_#t~ret3; 1495#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 1413#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 1411#L42-3 assume !(main_~k~0 <= main_~x~0); 1375#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 1349#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 1350#L42-3 [2019-11-28 20:30:27,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:27,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 3 times [2019-11-28 20:30:27,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:27,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658021179] [2019-11-28 20:30:27,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:27,861 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:27,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:27,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1510379783, now seen corresponding path program 3 times [2019-11-28 20:30:27,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:27,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475360254] [2019-11-28 20:30:27,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:27,874 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:30:27,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2094518064] [2019-11-28 20:30:27,876 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:30:27,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 20:30:27,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:30:27,903 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:30:27,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-28 20:30:27,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475360254] [2019-11-28 20:30:27,942 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 20:30:27,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094518064] [2019-11-28 20:30:27,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:30:27,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:30:27,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179202688] [2019-11-28 20:30:27,944 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:30:27,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:27,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:30:27,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:30:27,945 INFO L87 Difference]: Start difference. First operand 156 states and 247 transitions. cyclomatic complexity: 96 Second operand 6 states. [2019-11-28 20:30:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:28,047 INFO L93 Difference]: Finished difference Result 204 states and 331 transitions. [2019-11-28 20:30:28,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:30:28,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 331 transitions. [2019-11-28 20:30:28,052 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 73 [2019-11-28 20:30:28,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 198 states and 325 transitions. [2019-11-28 20:30:28,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2019-11-28 20:30:28,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2019-11-28 20:30:28,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 325 transitions. [2019-11-28 20:30:28,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:30:28,058 INFO L688 BuchiCegarLoop]: Abstraction has 198 states and 325 transitions. [2019-11-28 20:30:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 325 transitions. [2019-11-28 20:30:28,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 160. [2019-11-28 20:30:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-28 20:30:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 251 transitions. [2019-11-28 20:30:28,074 INFO L711 BuchiCegarLoop]: Abstraction has 160 states and 251 transitions. [2019-11-28 20:30:28,074 INFO L591 BuchiCegarLoop]: Abstraction has 160 states and 251 transitions. [2019-11-28 20:30:28,074 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:30:28,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 251 transitions. [2019-11-28 20:30:28,076 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2019-11-28 20:30:28,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:28,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:28,077 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:30:28,078 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:28,078 INFO L794 eck$LassoCheckResult]: Stem: 1894#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 1895#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 1840#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 1841#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 1843#L42-3 [2019-11-28 20:30:28,078 INFO L796 eck$LassoCheckResult]: Loop: 1843#L42-3 assume !!(main_~k~0 <= main_~x~0); 1926#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 1934#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 1947#factENTRY ~n := #in~n; 1950#L25 assume !(~n <= 0); 1912#L26 call #t~ret0 := fact(~n - 1);< 1913#factENTRY ~n := #in~n; 1956#L25 assume ~n <= 0;#res := 1; 1954#factFINAL assume true; 1952#factEXIT >#65#return; 1951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1945#factFINAL assume true; 1946#factEXIT >#67#return; 1935#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 1947#factENTRY ~n := #in~n; 1950#L25 assume !(~n <= 0); 1912#L26 call #t~ret0 := fact(~n - 1);< 1913#factENTRY ~n := #in~n; 1956#L25 assume ~n <= 0;#res := 1; 1954#factFINAL assume true; 1952#factEXIT >#65#return; 1951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1945#factFINAL assume true; 1946#factEXIT >#69#return; 1939#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 1947#factENTRY ~n := #in~n; 1950#L25 assume !(~n <= 0); 1912#L26 call #t~ret0 := fact(~n - 1);< 1913#factENTRY ~n := #in~n; 1956#L25 assume ~n <= 0;#res := 1; 1954#factFINAL assume true; 1952#factEXIT >#65#return; 1951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1945#factFINAL assume true; 1946#factEXIT >#71#return; 1942#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2;havoc binomialCoefficient_#t~ret3; 1958#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 1957#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 1843#L42-3 [2019-11-28 20:30:28,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:28,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 4 times [2019-11-28 20:30:28,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:28,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020475077] [2019-11-28 20:30:28,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:28,087 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:28,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1831628649, now seen corresponding path program 1 times [2019-11-28 20:30:28,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:28,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570126736] [2019-11-28 20:30:28,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:28,093 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:30:28,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217794726] [2019-11-28 20:30:28,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:30:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:28,130 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:30:28,132 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-28 20:30:28,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570126736] [2019-11-28 20:30:28,187 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 20:30:28,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217794726] [2019-11-28 20:30:28,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:30:28,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-11-28 20:30:28,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498536475] [2019-11-28 20:30:28,188 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:30:28,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:28,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:30:28,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:30:28,189 INFO L87 Difference]: Start difference. First operand 160 states and 251 transitions. cyclomatic complexity: 96 Second operand 9 states. [2019-11-28 20:30:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:28,566 INFO L93 Difference]: Finished difference Result 312 states and 527 transitions. [2019-11-28 20:30:28,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:30:28,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 527 transitions. [2019-11-28 20:30:28,573 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2019-11-28 20:30:28,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 312 states and 527 transitions. [2019-11-28 20:30:28,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2019-11-28 20:30:28,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2019-11-28 20:30:28,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 527 transitions. [2019-11-28 20:30:28,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:30:28,582 INFO L688 BuchiCegarLoop]: Abstraction has 312 states and 527 transitions. [2019-11-28 20:30:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 527 transitions. [2019-11-28 20:30:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 200. [2019-11-28 20:30:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-28 20:30:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 367 transitions. [2019-11-28 20:30:28,606 INFO L711 BuchiCegarLoop]: Abstraction has 200 states and 367 transitions. [2019-11-28 20:30:28,606 INFO L591 BuchiCegarLoop]: Abstraction has 200 states and 367 transitions. [2019-11-28 20:30:28,606 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:30:28,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 367 transitions. [2019-11-28 20:30:28,609 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 61 [2019-11-28 20:30:28,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:28,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:28,611 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:30:28,611 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:28,611 INFO L794 eck$LassoCheckResult]: Stem: 2500#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 2501#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 2445#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 2446#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 2448#L42-3 [2019-11-28 20:30:28,612 INFO L796 eck$LassoCheckResult]: Loop: 2448#L42-3 assume !!(main_~k~0 <= main_~x~0); 2530#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 2531#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 2556#factENTRY ~n := #in~n; 2562#L25 assume !(~n <= 0); 2563#L26 call #t~ret0 := fact(~n - 1);< 2528#factENTRY ~n := #in~n; 2575#L25 assume !(~n <= 0); 2569#L26 call #t~ret0 := fact(~n - 1);< 2528#factENTRY ~n := #in~n; 2575#L25 assume ~n <= 0;#res := 1; 2573#factFINAL assume true; 2568#factEXIT >#65#return; 2571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2577#factFINAL assume true; 2572#factEXIT >#65#return; 2567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2565#factFINAL assume true; 2558#factEXIT >#67#return; 2545#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 2556#factENTRY ~n := #in~n; 2562#L25 assume !(~n <= 0); 2563#L26 call #t~ret0 := fact(~n - 1);< 2528#factENTRY ~n := #in~n; 2575#L25 assume ~n <= 0;#res := 1; 2573#factFINAL assume true; 2568#factEXIT >#65#return; 2566#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2554#factFINAL assume true; 2555#factEXIT >#69#return; 2549#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 2556#factENTRY ~n := #in~n; 2562#L25 assume !(~n <= 0); 2563#L26 call #t~ret0 := fact(~n - 1);< 2528#factENTRY ~n := #in~n; 2575#L25 assume ~n <= 0;#res := 1; 2573#factFINAL assume true; 2568#factEXIT >#65#return; 2566#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2554#factFINAL assume true; 2555#factEXIT >#71#return; 2443#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2;havoc binomialCoefficient_#t~ret3; 2439#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 2440#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 2448#L42-3 [2019-11-28 20:30:28,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:28,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 5 times [2019-11-28 20:30:28,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:28,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931359106] [2019-11-28 20:30:28,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:28,621 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:28,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:28,622 INFO L82 PathProgramCache]: Analyzing trace with hash 794842995, now seen corresponding path program 2 times [2019-11-28 20:30:28,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:28,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878181751] [2019-11-28 20:30:28,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:28,629 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:30:28,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227679428] [2019-11-28 20:30:28,630 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:30:28,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:30:28,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-28 20:30:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:28,726 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:28,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:28,727 INFO L82 PathProgramCache]: Analyzing trace with hash 468385216, now seen corresponding path program 1 times [2019-11-28 20:30:28,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:28,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680185538] [2019-11-28 20:30:28,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:28,734 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:30:28,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [749675104] [2019-11-28 20:30:28,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:30:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:28,767 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:30:28,769 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 61 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-28 20:30:28,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680185538] [2019-11-28 20:30:28,802 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 20:30:28,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749675104] [2019-11-28 20:30:28,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:30:28,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-11-28 20:30:28,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595631113] [2019-11-28 20:30:29,497 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-11-28 20:30:29,762 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 30 [2019-11-28 20:30:29,764 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:29,764 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:29,764 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:29,764 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:29,764 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:30:29,765 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:29,765 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:29,765 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:29,765 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2019-11-28 20:30:29,765 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:29,765 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:29,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:29,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:29,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:29,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:29,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:29,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:29,989 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-28 20:30:30,358 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-28 20:30:30,384 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:30,385 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:30,392 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:30,392 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:30,400 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:30:30,400 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:30,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:30,405 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:30,417 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:30:30,418 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:30:30,431 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:30:30,433 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:30,433 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:30,433 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:30,433 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:30,434 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:30:30,434 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:30,434 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:30,434 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:30,434 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2019-11-28 20:30:30,434 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:30,434 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:30,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:30,928 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-28 20:30:31,003 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:31,004 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:31,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:31,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:31,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:31,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:31,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:31,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:31,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:31,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:31,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:31,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:30:31,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:31,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:31,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:31,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:31,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:31,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:31,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:31,031 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:30:31,035 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 20:30:31,035 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:31,040 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:30:31,040 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:30:31,041 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:30:31,041 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~k~0 + 3*ULTIMATE.start_main_~x~0 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 20:30:31,042 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:30:31,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:31,061 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:30:31,062 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:31,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 20:30:31,132 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-11-28 20:30:31,226 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 20:30:31,226 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 367 transitions. cyclomatic complexity: 172 Second operand 8 states. [2019-11-28 20:30:31,552 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 367 transitions. cyclomatic complexity: 172. Second operand 8 states. Result 729 states and 1257 transitions. Complement of second has 29 states. [2019-11-28 20:30:31,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-28 20:30:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:30:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2019-11-28 20:30:31,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 54 transitions. Stem has 4 letters. Loop has 44 letters. [2019-11-28 20:30:31,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:31,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 54 transitions. Stem has 48 letters. Loop has 44 letters. [2019-11-28 20:30:31,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:31,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 54 transitions. Stem has 4 letters. Loop has 88 letters. [2019-11-28 20:30:31,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:31,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 729 states and 1257 transitions. [2019-11-28 20:30:31,579 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 109 [2019-11-28 20:30:31,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 729 states to 622 states and 1064 transitions. [2019-11-28 20:30:31,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2019-11-28 20:30:31,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2019-11-28 20:30:31,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 622 states and 1064 transitions. [2019-11-28 20:30:31,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:30:31,597 INFO L688 BuchiCegarLoop]: Abstraction has 622 states and 1064 transitions. [2019-11-28 20:30:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states and 1064 transitions. [2019-11-28 20:30:31,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 584. [2019-11-28 20:30:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-28 20:30:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1011 transitions. [2019-11-28 20:30:31,645 INFO L711 BuchiCegarLoop]: Abstraction has 584 states and 1011 transitions. [2019-11-28 20:30:31,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:31,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:30:31,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:30:31,645 INFO L87 Difference]: Start difference. First operand 584 states and 1011 transitions. Second operand 6 states. [2019-11-28 20:30:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:31,888 INFO L93 Difference]: Finished difference Result 527 states and 860 transitions. [2019-11-28 20:30:31,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:30:31,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 527 states and 860 transitions. [2019-11-28 20:30:31,900 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 92 [2019-11-28 20:30:31,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 527 states to 527 states and 860 transitions. [2019-11-28 20:30:31,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2019-11-28 20:30:31,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2019-11-28 20:30:31,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 527 states and 860 transitions. [2019-11-28 20:30:31,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:30:31,912 INFO L688 BuchiCegarLoop]: Abstraction has 527 states and 860 transitions. [2019-11-28 20:30:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states and 860 transitions. [2019-11-28 20:30:31,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 510. [2019-11-28 20:30:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-11-28 20:30:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 836 transitions. [2019-11-28 20:30:31,944 INFO L711 BuchiCegarLoop]: Abstraction has 510 states and 836 transitions. [2019-11-28 20:30:31,945 INFO L591 BuchiCegarLoop]: Abstraction has 510 states and 836 transitions. [2019-11-28 20:30:31,945 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:30:31,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 510 states and 836 transitions. [2019-11-28 20:30:31,951 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 89 [2019-11-28 20:30:31,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:31,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:31,958 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:30:31,958 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:30:31,958 INFO L794 eck$LassoCheckResult]: Stem: 4888#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 4889#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 4837#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 4838#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 4972#L42-3 assume !!(main_~k~0 <= main_~x~0); 4933#L43 [2019-11-28 20:30:31,959 INFO L796 eck$LassoCheckResult]: Loop: 4933#L43 assume !(main_~k~0 <= main_~n~0);binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 5041#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 5048#factENTRY ~n := #in~n; 5075#L25 assume !(~n <= 0); 5061#L26 call #t~ret0 := fact(~n - 1);< 5066#factENTRY ~n := #in~n; 5078#L25 assume ~n <= 0;#res := 1; 5077#factFINAL assume true; 5072#factEXIT >#65#return; 5071#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5056#factFINAL assume true; 5040#factEXIT >#73#return; 5042#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 5048#factENTRY ~n := #in~n; 5075#L25 assume ~n <= 0;#res := 1; 5074#factFINAL assume true; 5058#factEXIT >#75#return; 5043#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 5052#factENTRY ~n := #in~n; 5081#L25 assume !(~n <= 0); 5061#L26 call #t~ret0 := fact(~n - 1);< 5066#factENTRY ~n := #in~n; 5078#L25 assume ~n <= 0;#res := 1; 5077#factFINAL assume true; 5072#factEXIT >#65#return; 5071#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5056#factFINAL assume true; 5040#factEXIT >#77#return; 5046#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2;havoc binomialCoefficient_#t~ret3; 4953#L30-9 main_#t~ret10 := binomialCoefficient_#res;havoc main_#t~ret10; 4954#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 5069#L42-3 assume !!(main_~k~0 <= main_~x~0); 4933#L43 [2019-11-28 20:30:31,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:31,960 INFO L82 PathProgramCache]: Analyzing trace with hash 37377045, now seen corresponding path program 1 times [2019-11-28 20:30:31,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:31,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801376735] [2019-11-28 20:30:31,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:31,986 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:31,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:31,987 INFO L82 PathProgramCache]: Analyzing trace with hash -868526809, now seen corresponding path program 1 times [2019-11-28 20:30:31,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:31,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996294642] [2019-11-28 20:30:31,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:32,005 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:30:32,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499853932] [2019-11-28 20:30:32,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:30:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:32,062 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:32,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:32,064 INFO L82 PathProgramCache]: Analyzing trace with hash 83908923, now seen corresponding path program 1 times [2019-11-28 20:30:32,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:32,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959396428] [2019-11-28 20:30:32,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:32,102 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: UNKNOWN during nested interpolation. I don't know how to continue at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:363) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkConcatFeasibility(LassoCheck.java:899) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:832) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 20:30:32,106 INFO L168 Benchmark]: Toolchain (without parser) took 10252.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 961.7 MB in the beginning and 943.8 MB in the end (delta: 17.9 MB). Peak memory consumption was 323.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:32,107 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:30:32,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.69 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:32,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:32,109 INFO L168 Benchmark]: Boogie Preprocessor took 29.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:32,109 INFO L168 Benchmark]: RCFGBuilder took 308.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:32,110 INFO L168 Benchmark]: BuchiAutomizer took 9559.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 943.8 MB in the end (delta: 159.1 MB). Peak memory consumption was 326.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:32,113 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 249.69 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 308.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9559.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 943.8 MB in the end (delta: 159.1 MB). Peak memory consumption was 326.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: UNKNOWN during nested interpolation. I don't know how to continue de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: UNKNOWN during nested interpolation. I don't know how to continue: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:363) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...