./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive/McCarthy91_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: 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 /storage/repos/svcomp/c/recursive/McCarthy91_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash edcc597a46f9ad79563531282ca675b8b1d7c4bf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:02:13,616 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:02:13,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:02:13,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:02:13,635 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:02:13,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:02:13,638 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:02:13,641 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:02:13,643 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:02:13,645 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:02:13,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:02:13,649 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:02:13,650 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:02:13,653 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:02:13,661 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:02:13,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:02:13,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:02:13,669 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:02:13,671 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:02:13,672 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:02:13,673 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:02:13,674 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:02:13,677 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:02:13,677 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:02:13,677 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:02:13,678 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:02:13,679 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:02:13,680 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:02:13,680 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:02:13,681 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:02:13,682 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:02:13,682 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:02:13,682 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:02:13,683 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:02:13,683 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:02:13,684 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:02:13,684 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:02:13,704 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:02:13,705 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:02:13,707 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:02:13,708 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:02:13,708 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:02:13,708 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:02:13,709 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:02:13,709 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:02:13,709 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:02:13,709 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:02:13,709 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:02:13,709 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:02:13,710 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:02:13,710 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:02:13,710 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:02:13,710 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:02:13,710 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:02:13,710 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:02:13,711 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:02:13,713 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:02:13,714 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:02:13,714 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:02:13,714 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:02:13,714 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:02:13,714 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:02:13,714 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:02:13,715 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:02:13,715 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:02:13,715 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:02:13,715 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:02:13,715 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:02:13,718 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:02:13,719 INFO L133 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> edcc597a46f9ad79563531282ca675b8b1d7c4bf [2018-11-29 00:02:13,792 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:02:13,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:02:13,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:02:13,813 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:02:13,814 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:02:13,814 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/McCarthy91_true-unreach-call_true-no-overflow_true-termination.c [2018-11-29 00:02:13,873 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9359b8160/093dfb71acd946ce826ad118e4d0f524/FLAGd91d626b7 [2018-11-29 00:02:14,317 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:02:14,318 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/McCarthy91_true-unreach-call_true-no-overflow_true-termination.c [2018-11-29 00:02:14,329 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9359b8160/093dfb71acd946ce826ad118e4d0f524/FLAGd91d626b7 [2018-11-29 00:02:14,706 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9359b8160/093dfb71acd946ce826ad118e4d0f524 [2018-11-29 00:02:14,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:02:14,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:02:14,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:02:14,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:02:14,720 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:02:14,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:14" (1/1) ... [2018-11-29 00:02:14,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef72e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:14, skipping insertion in model container [2018-11-29 00:02:14,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:14" (1/1) ... [2018-11-29 00:02:14,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:02:14,758 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:02:14,979 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:02:14,986 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:02:15,008 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:02:15,026 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:02:15,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:15 WrapperNode [2018-11-29 00:02:15,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:02:15,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:02:15,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:02:15,028 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:02:15,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:15" (1/1) ... [2018-11-29 00:02:15,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:15" (1/1) ... [2018-11-29 00:02:15,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:02:15,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:02:15,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:02:15,073 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:02:15,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:15" (1/1) ... [2018-11-29 00:02:15,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:15" (1/1) ... [2018-11-29 00:02:15,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:15" (1/1) ... [2018-11-29 00:02:15,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:15" (1/1) ... [2018-11-29 00:02:15,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:15" (1/1) ... [2018-11-29 00:02:15,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:15" (1/1) ... [2018-11-29 00:02:15,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:15" (1/1) ... [2018-11-29 00:02:15,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:02:15,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:02:15,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:02:15,095 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:02:15,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:15" (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 [2018-11-29 00:02:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:02:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:02:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2018-11-29 00:02:15,277 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2018-11-29 00:02:15,455 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:02:15,455 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-29 00:02:15,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:15 BoogieIcfgContainer [2018-11-29 00:02:15,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:02:15,457 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:02:15,457 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:02:15,461 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:02:15,461 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:15,462 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:02:14" (1/3) ... [2018-11-29 00:02:15,463 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31f8aeb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:02:15, skipping insertion in model container [2018-11-29 00:02:15,463 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:15,463 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:15" (2/3) ... [2018-11-29 00:02:15,463 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31f8aeb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:02:15, skipping insertion in model container [2018-11-29 00:02:15,464 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:15,464 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:15" (3/3) ... [2018-11-29 00:02:15,465 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthy91_true-unreach-call_true-no-overflow_true-termination.c [2018-11-29 00:02:15,531 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:02:15,534 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:02:15,534 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:02:15,535 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:02:15,535 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:02:15,535 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:02:15,536 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:02:15,536 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:02:15,536 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:02:15,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-29 00:02:15,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:02:15,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:15,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:15,646 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:02:15,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:02:15,648 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:02:15,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-29 00:02:15,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:02:15,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:15,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:15,653 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:02:15,653 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:02:15,669 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 3#L26true call main_#t~ret3 := f91(main_~x~0);< 16#f91ENTRYtrue [2018-11-29 00:02:15,670 INFO L796 eck$LassoCheckResult]: Loop: 16#f91ENTRYtrue ~x := #in~x; 10#L16true assume !(~x > 100); 7#L19true call #t~ret0 := f91(11 + ~x);< 16#f91ENTRYtrue [2018-11-29 00:02:15,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:15,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1015, now seen corresponding path program 1 times [2018-11-29 00:02:15,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:15,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:15,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:15,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:15,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:15,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:15,782 INFO L82 PathProgramCache]: Analyzing trace with hash 43828, now seen corresponding path program 1 times [2018-11-29 00:02:15,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:15,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:15,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:15,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:15,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:15,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:15,812 INFO L82 PathProgramCache]: Analyzing trace with hash 30251902, now seen corresponding path program 1 times [2018-11-29 00:02:15,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:15,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:15,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:15,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:15,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:15,989 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:15,992 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:15,993 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:15,993 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:15,993 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:15,993 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:15,993 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:15,993 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:15,994 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2018-11-29 00:02:15,994 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:15,994 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:16,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:16,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:16,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:16,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:16,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:16,160 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:16,161 INFO L412 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:16,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:16,175 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:16,195 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:16,195 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_~x=0} Honda state: {f91_~x=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 [2018-11-29 00:02:16,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:16,222 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:16,228 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:16,229 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2018-11-29 00:02:16,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:16,253 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:16,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:16,282 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:16,306 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:16,308 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:16,308 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:16,308 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:16,308 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:16,308 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:16,309 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:16,309 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:16,309 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:16,309 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2018-11-29 00:02:16,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:16,309 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:16,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:16,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:16,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:16,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:16,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:16,626 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:16,632 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:16,634 INFO L122 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 [2018-11-29 00:02:16,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:16,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:16,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:16,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:16,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:16,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:16,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:16,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:16,645 INFO L122 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 [2018-11-29 00:02:16,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:16,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:16,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:16,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:16,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:16,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:16,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:16,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:16,649 INFO L122 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 [2018-11-29 00:02:16,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:16,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:16,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:16,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:16,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:16,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:16,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:16,660 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:16,666 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:16,666 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:02:16,669 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:16,669 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:16,669 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:16,670 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -2*f91_#in~x + 211 Supporting invariants [] [2018-11-29 00:02:16,671 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:16,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:16,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:16,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:17,016 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 [2018-11-29 00:02:17,017 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2018-11-29 00:02:17,332 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 33 states and 41 transitions. Complement of second has 12 states. [2018-11-29 00:02:17,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:02:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-11-29 00:02:17,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-29 00:02:17,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:17,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-29 00:02:17,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:17,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-29 00:02:17,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:17,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 41 transitions. [2018-11-29 00:02:17,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:02:17,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 18 states and 24 transitions. [2018-11-29 00:02:17,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-29 00:02:17,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-29 00:02:17,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2018-11-29 00:02:17,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:17,358 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-29 00:02:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2018-11-29 00:02:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-29 00:02:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-29 00:02:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-29 00:02:17,389 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-29 00:02:17,389 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-29 00:02:17,389 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:02:17,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-29 00:02:17,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:02:17,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:17,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:17,392 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:17,392 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:17,393 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 99#L26 call main_#t~ret3 := f91(main_~x~0);< 104#f91ENTRY ~x := #in~x; 109#L16 assume !(~x > 100); 100#L19 call #t~ret0 := f91(11 + ~x);< 107#f91ENTRY ~x := #in~x; 110#L16 assume ~x > 100;#res := ~x - 10; 112#f91FINAL assume true; 111#f91EXIT >#26#return; 101#L19-1 [2018-11-29 00:02:17,393 INFO L796 eck$LassoCheckResult]: Loop: 101#L19-1 call #t~ret1 := f91(#t~ret0);< 106#f91ENTRY ~x := #in~x; 113#L16 assume !(~x > 100); 102#L19 call #t~ret0 := f91(11 + ~x);< 106#f91ENTRY ~x := #in~x; 113#L16 assume ~x > 100;#res := ~x - 10; 103#f91FINAL assume true; 108#f91EXIT >#26#return; 101#L19-1 [2018-11-29 00:02:17,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:17,395 INFO L82 PathProgramCache]: Analyzing trace with hash -495039419, now seen corresponding path program 1 times [2018-11-29 00:02:17,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:17,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:17,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:17,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:17,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:17,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:17,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1917219166, now seen corresponding path program 1 times [2018-11-29 00:02:17,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:17,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:17,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:17,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:17,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:17,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:17,429 INFO L82 PathProgramCache]: Analyzing trace with hash -984000794, now seen corresponding path program 1 times [2018-11-29 00:02:17,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:17,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:17,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:17,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:17,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:17,837 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-29 00:02:17,989 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-29 00:02:17,999 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:18,000 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:18,000 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:18,000 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:18,000 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:18,001 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:18,001 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:18,001 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:18,001 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_true-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2018-11-29 00:02:18,001 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:18,001 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:18,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:18,125 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-29 00:02:18,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:18,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:18,213 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:18,213 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:18,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:18,222 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) [2018-11-29 00:02:18,263 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:18,263 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:30,314 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-29 00:02:30,319 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:30,319 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:30,319 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:30,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:30,320 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:30,320 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:30,320 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:30,320 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:30,320 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_true-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2018-11-29 00:02:30,320 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:30,320 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:30,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:30,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:30,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:30,506 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:30,506 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:30,507 INFO L122 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 [2018-11-29 00:02:30,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:30,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:30,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:30,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:30,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:30,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:30,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:30,523 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:30,533 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:30,533 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:02:30,533 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:30,534 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:30,534 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:30,534 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#t~ret0) = -2*f91_#t~ret0 + 201 Supporting invariants [] [2018-11-29 00:02:30,535 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:30,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:30,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:30,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:30,964 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:02:30,964 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 9 states. [2018-11-29 00:02:31,389 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 9 states. Result 50 states and 72 transitions. Complement of second has 32 states. [2018-11-29 00:02:31,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:02:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-11-29 00:02:31,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2018-11-29 00:02:31,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:31,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 17 letters. Loop has 8 letters. [2018-11-29 00:02:31,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:31,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 9 letters. Loop has 16 letters. [2018-11-29 00:02:31,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:31,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 72 transitions. [2018-11-29 00:02:31,403 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-29 00:02:31,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 41 states and 61 transitions. [2018-11-29 00:02:31,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-29 00:02:31,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-29 00:02:31,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 61 transitions. [2018-11-29 00:02:31,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:31,409 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2018-11-29 00:02:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 61 transitions. [2018-11-29 00:02:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2018-11-29 00:02:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-29 00:02:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2018-11-29 00:02:31,419 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-11-29 00:02:31,419 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-11-29 00:02:31,419 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:02:31,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2018-11-29 00:02:31,421 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-29 00:02:31,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:31,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:31,423 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:31,423 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:02:31,423 INFO L794 eck$LassoCheckResult]: Stem: 291#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 289#L26 call main_#t~ret3 := f91(main_~x~0);< 290#f91ENTRY ~x := #in~x; 312#L16 assume !(~x > 100); 281#L19 call #t~ret0 := f91(11 + ~x);< 297#f91ENTRY ~x := #in~x; 303#L16 assume ~x > 100;#res := ~x - 10; 310#f91FINAL assume true; 309#f91EXIT >#26#return; 285#L19-1 call #t~ret1 := f91(#t~ret0);< 294#f91ENTRY ~x := #in~x; 313#L16 assume !(~x > 100); 295#L19 [2018-11-29 00:02:31,423 INFO L796 eck$LassoCheckResult]: Loop: 295#L19 call #t~ret0 := f91(11 + ~x);< 296#f91ENTRY ~x := #in~x; 304#L16 assume !(~x > 100); 295#L19 [2018-11-29 00:02:31,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:31,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1198389434, now seen corresponding path program 2 times [2018-11-29 00:02:31,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:31,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:31,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:31,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:31,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:31,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:31,439 INFO L82 PathProgramCache]: Analyzing trace with hash 54268, now seen corresponding path program 2 times [2018-11-29 00:02:31,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:31,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:31,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:31,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:31,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:31,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:31,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1451488419, now seen corresponding path program 3 times [2018-11-29 00:02:31,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:31,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:31,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:31,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:31,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-29 00:02:31,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:02:31,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-29 00:02:31,621 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:31,621 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:31,621 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:31,621 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:31,621 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:31,621 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:31,622 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:31,622 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:31,622 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2018-11-29 00:02:31,622 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:31,622 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:31,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:31,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:31,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:31,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:31,723 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:31,723 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:31,728 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:31,728 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:31,732 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:31,732 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret0=0} Honda state: {f91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:31,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:31,752 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:31,755 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:31,755 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret1=0} Honda state: {f91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:31,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:31,777 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:31,783 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:31,783 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:31,804 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:31,804 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:31,836 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:31,836 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:43,866 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-29 00:02:43,870 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:43,870 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:43,870 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:43,870 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:43,870 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:43,870 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:43,871 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:43,871 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:43,871 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2018-11-29 00:02:43,871 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:43,871 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:43,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:43,930 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:43,931 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:43,931 INFO L122 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 [2018-11-29 00:02:43,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:43,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:43,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:43,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:43,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:43,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:43,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:43,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:43,937 INFO L122 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 [2018-11-29 00:02:43,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:43,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:43,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:43,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:43,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:43,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:43,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:43,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:43,943 INFO L122 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 [2018-11-29 00:02:43,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:43,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:43,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:43,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:43,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:43,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:43,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:43,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:43,949 INFO L122 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 [2018-11-29 00:02:43,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:43,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:43,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:43,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:43,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:43,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:43,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:43,958 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:43,962 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:43,963 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:02:43,963 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:43,963 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:43,963 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:43,963 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_~x) = -2*f91_~x + 189 Supporting invariants [] [2018-11-29 00:02:43,964 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:44,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:44,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:44,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:44,132 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:02:44,133 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2018-11-29 00:02:44,257 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 42 states and 58 transitions. Complement of second has 13 states. [2018-11-29 00:02:44,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:44,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:02:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-11-29 00:02:44,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-29 00:02:44,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:44,261 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:44,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:44,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:44,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:44,380 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:02:44,380 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2018-11-29 00:02:44,491 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 42 states and 58 transitions. Complement of second has 13 states. [2018-11-29 00:02:44,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:02:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-11-29 00:02:44,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-29 00:02:44,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:44,497 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:44,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:44,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:44,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:44,697 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:02:44,698 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2018-11-29 00:02:44,879 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 70 states and 99 transitions. Complement of second has 16 states. [2018-11-29 00:02:44,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:02:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-11-29 00:02:44,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-29 00:02:44,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:44,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-29 00:02:44,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:44,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-29 00:02:44,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:44,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 99 transitions. [2018-11-29 00:02:44,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-29 00:02:44,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 47 states and 73 transitions. [2018-11-29 00:02:44,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-29 00:02:44,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-29 00:02:44,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2018-11-29 00:02:44,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:44,892 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2018-11-29 00:02:44,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2018-11-29 00:02:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-11-29 00:02:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-29 00:02:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2018-11-29 00:02:44,900 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 59 transitions. [2018-11-29 00:02:44,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-29 00:02:44,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-29 00:02:44,905 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand 8 states. [2018-11-29 00:02:45,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:45,047 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-11-29 00:02:45,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-29 00:02:45,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 81 transitions. [2018-11-29 00:02:45,055 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-29 00:02:45,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 57 states and 74 transitions. [2018-11-29 00:02:45,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-29 00:02:45,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-29 00:02:45,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 74 transitions. [2018-11-29 00:02:45,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:45,059 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 74 transitions. [2018-11-29 00:02:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 74 transitions. [2018-11-29 00:02:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-29 00:02:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-29 00:02:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2018-11-29 00:02:45,066 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2018-11-29 00:02:45,066 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2018-11-29 00:02:45,067 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:02:45,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2018-11-29 00:02:45,069 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-29 00:02:45,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:45,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:45,070 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-29 00:02:45,070 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2018-11-29 00:02:45,071 INFO L794 eck$LassoCheckResult]: Stem: 814#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 812#L26 call main_#t~ret3 := f91(main_~x~0);< 813#f91ENTRY ~x := #in~x; 834#L16 assume !(~x > 100); 835#L19 call #t~ret0 := f91(11 + ~x);< 841#f91ENTRY ~x := #in~x; 844#L16 assume !(~x > 100); 839#L19 call #t~ret0 := f91(11 + ~x);< 842#f91ENTRY ~x := #in~x; 845#L16 assume ~x > 100;#res := ~x - 10; 843#f91FINAL assume true; 840#f91EXIT >#26#return; 810#L19-1 call #t~ret1 := f91(#t~ret0);< 817#f91ENTRY ~x := #in~x; 859#L16 assume ~x > 100;#res := ~x - 10; 858#f91FINAL assume true; 855#f91EXIT >#28#return; 853#L19-2 #res := #t~ret1;havoc #t~ret0;havoc #t~ret1; 854#f91FINAL assume true; 852#f91EXIT >#26#return; 848#L19-1 call #t~ret1 := f91(#t~ret0);< 851#f91ENTRY [2018-11-29 00:02:45,071 INFO L796 eck$LassoCheckResult]: Loop: 851#f91ENTRY ~x := #in~x; 846#L16 assume !(~x > 100); 821#L19 call #t~ret0 := f91(11 + ~x);< 822#f91ENTRY ~x := #in~x; 830#L16 assume !(~x > 100); 820#L19 call #t~ret0 := f91(11 + ~x);< 823#f91ENTRY ~x := #in~x; 829#L16 assume ~x > 100;#res := ~x - 10; 861#f91FINAL assume true; 831#f91EXIT >#26#return; 807#L19-1 call #t~ret1 := f91(#t~ret0);< 815#f91ENTRY ~x := #in~x; 850#L16 assume ~x > 100;#res := ~x - 10; 824#f91FINAL assume true; 825#f91EXIT >#28#return; 853#L19-2 #res := #t~ret1;havoc #t~ret0;havoc #t~ret1; 854#f91FINAL assume true; 852#f91EXIT >#26#return; 847#L19-1 call #t~ret1 := f91(#t~ret0);< 851#f91ENTRY [2018-11-29 00:02:45,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:45,071 INFO L82 PathProgramCache]: Analyzing trace with hash 803701992, now seen corresponding path program 1 times [2018-11-29 00:02:45,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:45,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:45,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:45,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:45,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:45,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:45,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1260361570, now seen corresponding path program 1 times [2018-11-29 00:02:45,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:45,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:45,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:45,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:45,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:45,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:45,102 INFO L82 PathProgramCache]: Analyzing trace with hash 187356247, now seen corresponding path program 2 times [2018-11-29 00:02:45,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:45,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:45,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:45,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:45,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-29 00:02:45,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:45,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:02:45,236 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:02:45,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:02:45,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:02:45,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-29 00:02:45,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:45,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-29 00:02:45,793 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-29 00:02:45,812 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:45,813 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:45,813 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:45,813 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:45,813 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:45,813 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:45,814 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:45,814 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:45,814 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2018-11-29 00:02:45,814 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:45,814 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:45,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:45,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:45,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:45,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:45,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:45,919 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:45,922 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:45,925 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:45,926 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:45,928 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:45,929 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret1=0} Honda state: {f91_#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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:45,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:45,952 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:45,955 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:45,955 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_~x=0} Honda state: {f91_~x=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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:45,978 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:45,978 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:45,980 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:45,980 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:46,002 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:46,002 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:46,005 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:46,005 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret0=0} Honda state: {f91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:46,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:46,030 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-29 00:02:46,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:46,055 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:46,487 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:46,490 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:46,490 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:46,490 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:46,490 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:46,490 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:46,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:46,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:46,491 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:46,491 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2018-11-29 00:02:46,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:46,491 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:46,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,572 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:46,572 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:46,573 INFO L122 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 [2018-11-29 00:02:46,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:46,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:46,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:46,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:46,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:46,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:46,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:46,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:46,579 INFO L122 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 [2018-11-29 00:02:46,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:46,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:46,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:46,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:46,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:46,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:46,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:46,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:46,582 INFO L122 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 [2018-11-29 00:02:46,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:46,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:46,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:46,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:46,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:46,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:46,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:46,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:46,585 INFO L122 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 [2018-11-29 00:02:46,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:46,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:46,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:46,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:46,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:46,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:46,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:46,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:46,588 INFO L122 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 [2018-11-29 00:02:46,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:46,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:46,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:46,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:46,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:46,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:46,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:46,593 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:46,596 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:46,596 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:02:46,596 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:46,596 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:46,597 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:46,597 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -1*f91_#in~x + 90 Supporting invariants [] [2018-11-29 00:02:46,597 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:46,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:46,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:46,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-29 00:02:47,023 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-29 00:02:47,024 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2018-11-29 00:02:47,511 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 124 states and 149 transitions. Complement of second has 47 states. [2018-11-29 00:02:47,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-29 00:02:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-11-29 00:02:47,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 21 letters. Loop has 19 letters. [2018-11-29 00:02:47,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:47,514 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:47,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:47,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:47,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-29 00:02:48,051 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-29 00:02:48,052 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2018-11-29 00:02:48,646 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 124 states and 149 transitions. Complement of second has 47 states. [2018-11-29 00:02:48,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-29 00:02:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-11-29 00:02:48,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 21 letters. Loop has 19 letters. [2018-11-29 00:02:48,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:48,650 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:48,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:48,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:48,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-29 00:02:48,977 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-29 00:02:48,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2018-11-29 00:02:50,234 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 430 states and 530 transitions. Complement of second has 216 states. [2018-11-29 00:02:50,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 2 stem states 17 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-29 00:02:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 48 transitions. [2018-11-29 00:02:50,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 21 letters. Loop has 19 letters. [2018-11-29 00:02:50,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:50,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 40 letters. Loop has 19 letters. [2018-11-29 00:02:50,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:50,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 21 letters. Loop has 38 letters. [2018-11-29 00:02:50,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:50,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 530 transitions. [2018-11-29 00:02:50,253 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-29 00:02:50,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 202 states and 268 transitions. [2018-11-29 00:02:50,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2018-11-29 00:02:50,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-11-29 00:02:50,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 268 transitions. [2018-11-29 00:02:50,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:50,261 INFO L705 BuchiCegarLoop]: Abstraction has 202 states and 268 transitions. [2018-11-29 00:02:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 268 transitions. [2018-11-29 00:02:50,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 156. [2018-11-29 00:02:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-29 00:02:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 197 transitions. [2018-11-29 00:02:50,284 INFO L728 BuchiCegarLoop]: Abstraction has 156 states and 197 transitions. [2018-11-29 00:02:50,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-29 00:02:50,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-29 00:02:50,285 INFO L87 Difference]: Start difference. First operand 156 states and 197 transitions. Second operand 9 states. [2018-11-29 00:02:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:50,588 INFO L93 Difference]: Finished difference Result 158 states and 187 transitions. [2018-11-29 00:02:50,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-29 00:02:50,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 187 transitions. [2018-11-29 00:02:50,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-29 00:02:50,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 103 states and 122 transitions. [2018-11-29 00:02:50,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-29 00:02:50,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-11-29 00:02:50,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 122 transitions. [2018-11-29 00:02:50,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:50,610 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 122 transitions. [2018-11-29 00:02:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 122 transitions. [2018-11-29 00:02:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-11-29 00:02:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-29 00:02:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2018-11-29 00:02:50,633 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 118 transitions. [2018-11-29 00:02:50,633 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 118 transitions. [2018-11-29 00:02:50,633 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:02:50,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 118 transitions. [2018-11-29 00:02:50,635 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-29 00:02:50,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:50,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:50,642 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1] [2018-11-29 00:02:50,642 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:50,642 INFO L794 eck$LassoCheckResult]: Stem: 2797#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 2789#L26 call main_#t~ret3 := f91(main_~x~0);< 2790#f91ENTRY ~x := #in~x; 2818#L16 assume !(~x > 100); 2814#L19 call #t~ret0 := f91(11 + ~x);< 2813#f91ENTRY ~x := #in~x; 2816#L16 assume !(~x > 100); 2815#L19 call #t~ret0 := f91(11 + ~x);< 2847#f91ENTRY ~x := #in~x; 2850#L16 assume ~x > 100;#res := ~x - 10; 2849#f91FINAL assume true; 2848#f91EXIT >#26#return; 2843#L19-1 call #t~ret1 := f91(#t~ret0);< 2845#f91ENTRY ~x := #in~x; 2865#L16 assume ~x > 100;#res := ~x - 10; 2851#f91FINAL assume true; 2842#f91EXIT >#28#return; 2841#L19-2 #res := #t~ret1;havoc #t~ret0;havoc #t~ret1; 2839#f91FINAL assume true; 2838#f91EXIT >#26#return; 2832#L19-1 call #t~ret1 := f91(#t~ret0);< 2837#f91ENTRY ~x := #in~x; 2835#L16 assume !(~x > 100); 2799#L19 call #t~ret0 := f91(11 + ~x);< 2807#f91ENTRY ~x := #in~x; 2840#L16 assume !(~x > 100); 2800#L19 call #t~ret0 := f91(11 + ~x);< 2806#f91ENTRY ~x := #in~x; 2882#L16 assume ~x > 100;#res := ~x - 10; 2881#f91FINAL assume true; 2878#f91EXIT >#26#return; 2798#L19-1 [2018-11-29 00:02:50,642 INFO L796 eck$LassoCheckResult]: Loop: 2798#L19-1 call #t~ret1 := f91(#t~ret0);< 2801#f91ENTRY ~x := #in~x; 2830#L16 assume !(~x > 100); 2831#L19 call #t~ret0 := f91(11 + ~x);< 2879#f91ENTRY ~x := #in~x; 2886#L16 assume ~x > 100;#res := ~x - 10; 2885#f91FINAL assume true; 2877#f91EXIT >#26#return; 2798#L19-1 [2018-11-29 00:02:50,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:50,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1994701169, now seen corresponding path program 3 times [2018-11-29 00:02:50,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:50,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:50,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:50,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-29 00:02:50,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:50,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:02:50,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:02:50,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-29 00:02:50,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:02:50,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:50,841 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-29 00:02:50,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-29 00:02:50,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2018-11-29 00:02:50,864 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:50,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:50,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1917219166, now seen corresponding path program 2 times [2018-11-29 00:02:50,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:50,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:50,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:50,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:50,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:51,017 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:51,017 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:51,017 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:51,017 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:51,017 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:51,018 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:51,018 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:51,018 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:51,018 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2018-11-29 00:02:51,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:51,018 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:51,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:51,067 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:51,067 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:51,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:51,075 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:51,078 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:51,078 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2018-11-29 00:02:51,100 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:51,100 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:51,103 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:51,103 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret1=0} Honda state: {f91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2018-11-29 00:02:51,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:51,130 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 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 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:51,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:51,165 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:03,788 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-29 00:03:03,791 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:03,791 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:03,791 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:03,791 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:03,791 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:03,791 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:03,791 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:03,791 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:03,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2018-11-29 00:03:03,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:03,792 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:03,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:03,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:03,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:03,842 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:03,843 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:03,843 INFO L122 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 [2018-11-29 00:03:03,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:03,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:03,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:03,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:03,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:03,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:03,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:03,851 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:03,855 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:03,856 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:03:03,856 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:03,856 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:03,856 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:03,857 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#t~ret0) = -2*f91_#t~ret0 + 201 Supporting invariants [] [2018-11-29 00:03:03,857 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:03,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:03,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:04,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:04,161 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:03:04,161 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2018-11-29 00:03:04,392 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 138 states and 160 transitions. Complement of second has 24 states. [2018-11-29 00:03:04,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:04,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-11-29 00:03:04,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 31 letters. Loop has 8 letters. [2018-11-29 00:03:04,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:04,404 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:04,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:04,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:04,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:04,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:04,633 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:03:04,633 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2018-11-29 00:03:04,838 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 138 states and 160 transitions. Complement of second has 24 states. [2018-11-29 00:03:04,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-11-29 00:03:04,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 31 letters. Loop has 8 letters. [2018-11-29 00:03:04,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:04,843 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:04,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:04,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:04,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:05,120 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:03:05,121 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2018-11-29 00:03:05,500 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 180 states and 210 transitions. Complement of second has 27 states. [2018-11-29 00:03:05,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-29 00:03:05,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 31 letters. Loop has 8 letters. [2018-11-29 00:03:05,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:05,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 39 letters. Loop has 8 letters. [2018-11-29 00:03:05,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:05,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 31 letters. Loop has 16 letters. [2018-11-29 00:03:05,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:05,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 210 transitions. [2018-11-29 00:03:05,516 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:05,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 0 states and 0 transitions. [2018-11-29 00:03:05,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:05,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:05,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:05,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:05,517 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:05,517 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:05,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-29 00:03:05,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-29 00:03:05,518 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 9 states. [2018-11-29 00:03:05,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:05,518 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-29 00:03:05,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:03:05,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-29 00:03:05,521 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:05,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-29 00:03:05,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:05,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:05,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:05,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:05,522 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:05,522 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:05,522 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:05,522 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:03:05,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:03:05,522 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:05,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:03:05,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:03:05 BoogieIcfgContainer [2018-11-29 00:03:05,530 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:03:05,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:03:05,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:03:05,530 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:03:05,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:15" (3/4) ... [2018-11-29 00:03:05,534 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:03:05,534 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:03:05,535 INFO L168 Benchmark]: Toolchain (without parser) took 50824.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 952.7 MB in the beginning and 845.3 MB in the end (delta: 107.4 MB). Peak memory consumption was 402.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:05,536 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:05,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.78 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:05,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.29 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:05,539 INFO L168 Benchmark]: Boogie Preprocessor took 21.30 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:05,539 INFO L168 Benchmark]: RCFGBuilder took 361.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -193.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:05,540 INFO L168 Benchmark]: BuchiAutomizer took 50072.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 845.3 MB in the end (delta: 289.0 MB). Peak memory consumption was 433.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:05,541 INFO L168 Benchmark]: Witness Printer took 4.36 ms. Allocated memory is still 1.3 GB. Free memory is still 845.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:05,548 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.78 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.29 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.30 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 361.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -193.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 50072.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 845.3 MB in the end (delta: 289.0 MB). Peak memory consumption was 433.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.36 ms. Allocated memory is still 1.3 GB. Free memory is still 845.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function -2 * \old(x) + 211 and consists of 4 locations. One deterministic module has affine ranking function -2 * aux-f91(x+11)-aux + 201 and consists of 8 locations. One nondeterministic module has affine ranking function -2 * x + 189 and consists of 6 locations. One nondeterministic module has affine ranking function -1 * \old(x) + 90 and consists of 20 locations. One nondeterministic module has affine ranking function -2 * aux-f91(x+11)-aux + 201 and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 50.0s and 6 iterations. TraceHistogramMax:7. Analysis of lassos took 41.5s. Construction of modules took 1.2s. Büchi inclusion checks took 6.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 99 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/24 HoareTripleCheckerStatistics: 155 SDtfs, 273 SDslu, 162 SDs, 0 SdLazy, 735 SolverSat, 231 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf96 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf92 smp100 dnf100 smp100 tf109 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 3 LassoNonterminationAnalysisTime: 37.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...