./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/Urban-WST2013-Fig2_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/termination-crafted-lit/Urban-WST2013-Fig2_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 31d0c4253184c01eb9f9573658b07bed7aa94585 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:34:51,718 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:34:51,720 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:34:51,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:34:51,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:34:51,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:34:51,745 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:34:51,748 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:34:51,753 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:34:51,755 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:34:51,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:34:51,759 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:34:51,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:34:51,761 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:34:51,769 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:34:51,770 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:34:51,771 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:34:51,774 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:34:51,779 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:34:51,782 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:34:51,785 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:34:51,788 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:34:51,793 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:34:51,795 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:34:51,795 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:34:51,797 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:34:51,798 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:34:51,799 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:34:51,799 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:34:51,805 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:34:51,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:34:51,807 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:34:51,808 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:34:51,808 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:34:51,810 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:34:51,811 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:34:51,811 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:34:51,838 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:34:51,839 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:34:51,841 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:34:51,842 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:34:51,842 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:34:51,842 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:34:51,843 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:34:51,844 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:34:51,844 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:34:51,844 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:34:51,844 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:34:51,844 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:34:51,845 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:34:51,845 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:34:51,845 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:34:51,846 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:34:51,846 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:34:51,846 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:34:51,846 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:34:51,846 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:34:51,846 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:34:51,847 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:34:51,849 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:34:51,849 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:34:51,850 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:34:51,850 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:34:51,850 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:34:51,850 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:34:51,851 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:34:51,851 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31d0c4253184c01eb9f9573658b07bed7aa94585 [2019-01-01 21:34:51,913 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:34:51,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:34:51,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:34:51,950 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:34:51,950 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:34:51,951 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/Urban-WST2013-Fig2_true-termination_true-no-overflow.c [2019-01-01 21:34:52,033 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4d8db7d9/2eea5c5ae2f34b55b746da115dd33657/FLAG8c9ba1651 [2019-01-01 21:34:52,592 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:34:52,593 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/Urban-WST2013-Fig2_true-termination_true-no-overflow.c [2019-01-01 21:34:52,599 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4d8db7d9/2eea5c5ae2f34b55b746da115dd33657/FLAG8c9ba1651 [2019-01-01 21:34:52,914 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4d8db7d9/2eea5c5ae2f34b55b746da115dd33657 [2019-01-01 21:34:52,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:34:52,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:34:52,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:34:52,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:34:52,926 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:34:52,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:34:52" (1/1) ... [2019-01-01 21:34:52,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9b7a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:52, skipping insertion in model container [2019-01-01 21:34:52,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:34:52" (1/1) ... [2019-01-01 21:34:52,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:34:52,961 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:34:53,138 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:34:53,143 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:34:53,164 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:34:53,180 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:34:53,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53 WrapperNode [2019-01-01 21:34:53,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:34:53,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:34:53,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:34:53,183 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:34:53,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:34:53,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:34:53,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:34:53,222 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:34:53,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... [2019-01-01 21:34:53,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:34:53,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:34:53,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:34:53,243 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:34:53,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:53,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:34:53,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:34:53,551 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:34:53,552 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 21:34:53,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:53 BoogieIcfgContainer [2019-01-01 21:34:53,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:34:53,553 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:34:53,553 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:34:53,558 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:34:53,559 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:53,559 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:34:52" (1/3) ... [2019-01-01 21:34:53,560 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cbf09c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:34:53, skipping insertion in model container [2019-01-01 21:34:53,561 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:53,561 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:53" (2/3) ... [2019-01-01 21:34:53,561 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cbf09c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:34:53, skipping insertion in model container [2019-01-01 21:34:53,562 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:53,562 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:53" (3/3) ... [2019-01-01 21:34:53,564 INFO L375 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2_true-termination_true-no-overflow.c [2019-01-01 21:34:53,631 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:34:53,632 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:34:53,632 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:34:53,632 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:34:53,633 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:34:53,633 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:34:53,633 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:34:53,633 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:34:53,633 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:34:53,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:34:53,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:34:53,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:53,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:53,679 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:53,679 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:34:53,680 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:34:53,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:34:53,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:34:53,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:53,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:53,682 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:53,682 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:34:53,693 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L19-2true [2019-01-01 21:34:53,693 INFO L796 eck$LassoCheckResult]: Loop: 6#L19-2true assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 9#L21-2true assume !(main_~x2~0 > 1); 8#L21-3true main_~x1~0 := 1 + main_~x1~0; 6#L19-2true [2019-01-01 21:34:53,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:53,705 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:34:53,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:53,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:53,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:53,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:53,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:53,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:53,817 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-01 21:34:53,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:53,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:53,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:53,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:53,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:53,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:34:53,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:34:53,932 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:34:53,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:34:53,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:34:54,001 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-01-01 21:34:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:34:54,103 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-01 21:34:54,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:34:54,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-01-01 21:34:54,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:34:54,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 5 states and 6 transitions. [2019-01-01 21:34:54,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:34:54,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:34:54,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2019-01-01 21:34:54,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:54,126 INFO L705 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-01-01 21:34:54,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2019-01-01 21:34:54,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-01 21:34:54,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:34:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-01-01 21:34:54,166 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-01-01 21:34:54,167 INFO L608 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-01-01 21:34:54,167 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:34:54,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2019-01-01 21:34:54,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:34:54,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:54,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:54,169 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:54,170 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:34:54,170 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 27#L19-2 [2019-01-01 21:34:54,170 INFO L796 eck$LassoCheckResult]: Loop: 27#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 28#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 30#L21-2 assume !(main_~x2~0 > 1); 29#L21-3 main_~x1~0 := 1 + main_~x1~0; 27#L19-2 [2019-01-01 21:34:54,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:54,171 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-01 21:34:54,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:54,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:54,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:54,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:54,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1240240, now seen corresponding path program 1 times [2019-01-01 21:34:54,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:54,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:54,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:54,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:54,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:34:54,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:34:54,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:54,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:54,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:34:54,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 21:34:54,517 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:34:54,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:34:54,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:34:54,518 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-01-01 21:34:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:34:54,618 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-01-01 21:34:54,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:34:54,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. [2019-01-01 21:34:54,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:34:54,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 7 transitions. [2019-01-01 21:34:54,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:34:54,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:34:54,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2019-01-01 21:34:54,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:54,622 INFO L705 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 21:34:54,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2019-01-01 21:34:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-01 21:34:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:34:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-01 21:34:54,624 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 21:34:54,624 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 21:34:54,624 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:34:54,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-01-01 21:34:54,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:34:54,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:54,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:54,625 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:54,625 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1] [2019-01-01 21:34:54,626 INFO L794 eck$LassoCheckResult]: Stem: 53#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 54#L19-2 [2019-01-01 21:34:54,626 INFO L796 eck$LassoCheckResult]: Loop: 54#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 55#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 57#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 58#L21-2 assume !(main_~x2~0 > 1); 56#L21-3 main_~x1~0 := 1 + main_~x1~0; 54#L19-2 [2019-01-01 21:34:54,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:54,626 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-01 21:34:54,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:54,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:54,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:54,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:54,634 INFO L82 PathProgramCache]: Analyzing trace with hash 38449199, now seen corresponding path program 2 times [2019-01-01 21:34:54,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:54,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:54,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:54,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:54,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:34:54,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:34:54,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:34:54,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:34:54,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:34:54,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:54,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:34:54,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 21:34:54,786 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:34:54,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:34:54,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:34:54,787 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-01-01 21:34:54,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:34:54,816 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-01-01 21:34:54,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:34:54,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2019-01-01 21:34:54,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:34:54,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2019-01-01 21:34:54,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:34:54,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:34:54,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-01-01 21:34:54,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:54,820 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-01 21:34:54,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-01-01 21:34:54,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-01 21:34:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:34:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-01 21:34:54,822 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-01 21:34:54,822 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-01 21:34:54,822 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:34:54,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-01-01 21:34:54,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:34:54,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:54,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:54,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:54,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 1, 1, 1] [2019-01-01 21:34:54,824 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 87#L19-2 [2019-01-01 21:34:54,824 INFO L796 eck$LassoCheckResult]: Loop: 87#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 88#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 90#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 92#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 91#L21-2 assume !(main_~x2~0 > 1); 89#L21-3 main_~x1~0 := 1 + main_~x1~0; 87#L19-2 [2019-01-01 21:34:54,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:54,824 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-01-01 21:34:54,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:54,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:54,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:54,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1191926928, now seen corresponding path program 3 times [2019-01-01 21:34:54,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:54,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:54,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:54,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:54,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:34:54,967 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:34:54,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:34:55,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-01 21:34:55,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:34:55,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:55,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:34:55,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 21:34:55,057 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:34:55,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:34:55,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:34:55,059 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-01-01 21:34:55,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:34:55,094 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-01-01 21:34:55,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:34:55,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2019-01-01 21:34:55,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:34:55,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2019-01-01 21:34:55,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:34:55,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:34:55,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2019-01-01 21:34:55,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:55,102 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-01 21:34:55,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2019-01-01 21:34:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-01 21:34:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:34:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-01 21:34:55,105 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-01 21:34:55,105 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-01 21:34:55,105 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:34:55,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2019-01-01 21:34:55,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:34:55,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:55,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:55,114 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:55,114 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1, 1] [2019-01-01 21:34:55,114 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 126#L19-2 [2019-01-01 21:34:55,115 INFO L796 eck$LassoCheckResult]: Loop: 126#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 127#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 129#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 132#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 131#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 130#L21-2 assume !(main_~x2~0 > 1); 128#L21-3 main_~x1~0 := 1 + main_~x1~0; 126#L19-2 [2019-01-01 21:34:55,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:55,117 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-01-01 21:34:55,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:55,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:55,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:55,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:55,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1704969137, now seen corresponding path program 4 times [2019-01-01 21:34:55,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:55,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:55,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:55,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:55,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:55,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:34:55,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:34:55,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:34:55,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:34:55,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:34:55,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:55,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:34:55,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 21:34:55,529 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:34:55,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:34:55,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:34:55,530 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 7 states. [2019-01-01 21:34:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:34:55,606 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-01 21:34:55,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 21:34:55,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-01-01 21:34:55,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:34:55,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-01-01 21:34:55,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:34:55,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 21:34:55,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-01-01 21:34:55,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:55,610 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-01 21:34:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-01-01 21:34:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-01 21:34:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:34:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-01 21:34:55,612 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-01 21:34:55,612 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-01 21:34:55,612 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:34:55,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-01-01 21:34:55,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:34:55,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:55,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:55,613 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:55,613 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 1, 1, 1] [2019-01-01 21:34:55,614 INFO L794 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 171#L19-2 [2019-01-01 21:34:55,614 INFO L796 eck$LassoCheckResult]: Loop: 171#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 172#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 174#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 178#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 177#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 176#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 175#L21-2 assume !(main_~x2~0 > 1); 173#L21-3 main_~x1~0 := 1 + main_~x1~0; 171#L19-2 [2019-01-01 21:34:55,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:55,614 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-01-01 21:34:55,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:55,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:55,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:55,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:55,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:55,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:55,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1314433936, now seen corresponding path program 5 times [2019-01-01 21:34:55,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:55,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:55,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:55,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:55,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:55,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:34:55,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:34:55,776 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:34:55,788 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-01-01 21:34:55,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:34:55,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:55,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:34:55,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 21:34:55,822 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:34:55,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:34:55,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:34:55,824 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 8 states. [2019-01-01 21:34:55,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:34:55,951 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-01-01 21:34:55,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:34:55,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-01-01 21:34:55,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:34:55,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-01-01 21:34:55,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:34:55,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:34:55,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-01-01 21:34:55,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:55,956 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-01-01 21:34:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-01-01 21:34:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-01 21:34:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:34:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-01-01 21:34:55,958 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-01-01 21:34:55,958 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-01-01 21:34:55,958 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:34:55,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2019-01-01 21:34:55,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:34:55,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:55,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:55,960 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:55,960 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 1, 1, 1] [2019-01-01 21:34:55,960 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 222#L19-2 [2019-01-01 21:34:55,960 INFO L796 eck$LassoCheckResult]: Loop: 222#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 223#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 225#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 230#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 229#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 228#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 227#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 226#L21-2 assume !(main_~x2~0 > 1); 224#L21-3 main_~x1~0 := 1 + main_~x1~0; 222#L19-2 [2019-01-01 21:34:55,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:55,961 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-01-01 21:34:55,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:55,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:55,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:55,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:55,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:55,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2092744593, now seen corresponding path program 6 times [2019-01-01 21:34:55,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:55,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:55,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:55,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:55,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:56,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:34:56,102 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:34:56,112 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 21:34:56,139 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-01-01 21:34:56,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:34:56,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:56,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:34:56,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 21:34:56,170 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:34:56,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:34:56,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:34:56,171 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 9 states. [2019-01-01 21:34:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:34:56,209 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-01 21:34:56,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:34:56,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-01-01 21:34:56,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 21:34:56,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2019-01-01 21:34:56,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:34:56,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:34:56,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2019-01-01 21:34:56,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:56,212 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-01 21:34:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2019-01-01 21:34:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 21:34:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:34:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-01 21:34:56,216 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-01 21:34:56,216 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-01 21:34:56,217 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:34:56,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-01-01 21:34:56,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 21:34:56,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:56,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:56,218 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:56,218 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 1, 1, 1] [2019-01-01 21:34:56,218 INFO L794 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 279#L19-2 [2019-01-01 21:34:56,219 INFO L796 eck$LassoCheckResult]: Loop: 279#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 280#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 282#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 288#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 287#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 286#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 285#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 284#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 283#L21-2 assume !(main_~x2~0 > 1); 281#L21-3 main_~x1~0 := 1 + main_~x1~0; 279#L19-2 [2019-01-01 21:34:56,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:56,219 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-01-01 21:34:56,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:56,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:56,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:56,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:56,225 INFO L82 PathProgramCache]: Analyzing trace with hash -450571184, now seen corresponding path program 7 times [2019-01-01 21:34:56,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:56,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:56,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:56,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:56,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:34:56,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:34:56,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:56,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:56,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:34:56,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 21:34:56,734 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:34:56,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 21:34:56,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:34:56,735 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. [2019-01-01 21:34:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:34:56,836 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-01-01 21:34:56,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:34:56,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-01-01 21:34:56,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:34:56,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2019-01-01 21:34:56,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 21:34:56,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-01 21:34:56,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-01-01 21:34:56,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:56,841 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-01 21:34:56,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-01-01 21:34:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-01 21:34:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:34:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-01 21:34:56,843 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-01 21:34:56,843 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-01 21:34:56,843 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 21:34:56,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-01-01 21:34:56,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:34:56,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:56,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:56,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:56,845 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 1, 1, 1] [2019-01-01 21:34:56,845 INFO L794 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 342#L19-2 [2019-01-01 21:34:56,845 INFO L796 eck$LassoCheckResult]: Loop: 342#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 343#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 345#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 352#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 351#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 350#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 349#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 348#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 347#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 346#L21-2 assume !(main_~x2~0 > 1); 344#L21-3 main_~x1~0 := 1 + main_~x1~0; 342#L19-2 [2019-01-01 21:34:56,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:56,845 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-01-01 21:34:56,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:56,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:56,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:56,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:56,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:56,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1082803057, now seen corresponding path program 8 times [2019-01-01 21:34:56,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:56,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:56,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:56,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:57,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:34:57,009 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:34:57,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:34:57,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:34:57,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:34:57,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:57,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:34:57,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 21:34:57,069 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:34:57,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 21:34:57,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 21:34:57,070 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 11 states. [2019-01-01 21:34:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:34:57,144 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-01-01 21:34:57,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:34:57,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-01-01 21:34:57,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-01 21:34:57,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-01-01 21:34:57,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:34:57,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:34:57,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-01-01 21:34:57,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:57,148 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-01 21:34:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-01-01 21:34:57,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-01 21:34:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 21:34:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-01 21:34:57,150 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-01 21:34:57,151 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-01 21:34:57,151 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 21:34:57,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-01-01 21:34:57,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-01 21:34:57,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:57,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:57,152 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:57,152 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 1, 1, 1] [2019-01-01 21:34:57,152 INFO L794 eck$LassoCheckResult]: Stem: 410#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 411#L19-2 [2019-01-01 21:34:57,153 INFO L796 eck$LassoCheckResult]: Loop: 411#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 412#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 414#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 422#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 421#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 420#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 419#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 418#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 417#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 416#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 415#L21-2 assume !(main_~x2~0 > 1); 413#L21-3 main_~x1~0 := 1 + main_~x1~0; 411#L19-2 [2019-01-01 21:34:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:57,153 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-01-01 21:34:57,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:57,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:57,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:57,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:57,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:57,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:57,160 INFO L82 PathProgramCache]: Analyzing trace with hash 792845360, now seen corresponding path program 9 times [2019-01-01 21:34:57,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:57,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:57,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:57,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:57,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:57,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:57,178 INFO L82 PathProgramCache]: Analyzing trace with hash 287286735, now seen corresponding path program 1 times [2019-01-01 21:34:57,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:57,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:57,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:57,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:57,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:57,521 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-01-01 21:34:57,551 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:57,553 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:57,553 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:57,553 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:57,553 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:57,553 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:57,553 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:57,554 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:57,554 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2_true-termination_true-no-overflow.c_Iteration10_Loop [2019-01-01 21:34:57,554 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:57,554 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:57,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,735 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:57,736 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:57,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:57,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:57,770 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:57,771 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} 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 [2019-01-01 21:34:57,787 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:57,787 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:57,847 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:57,848 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:34:57,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:57,859 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:34:57,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:57,914 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:57,944 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:57,946 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:57,947 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:57,947 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:57,947 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:57,947 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:57,947 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:57,947 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:57,947 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:57,948 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2_true-termination_true-no-overflow.c_Iteration10_Loop [2019-01-01 21:34:57,948 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:57,948 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:57,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:57,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:58,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:58,132 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:58,139 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:58,142 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 [2019-01-01 21:34:58,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:58,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:58,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:58,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:58,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:58,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:58,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:58,159 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 [2019-01-01 21:34:58,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:58,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:58,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:58,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:58,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:58,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:58,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:58,172 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 [2019-01-01 21:34:58,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:58,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:58,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:58,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:58,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:58,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:58,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:58,183 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:58,187 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:58,188 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:34:58,191 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:58,191 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:58,191 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:58,192 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x1~0) = -2*ULTIMATE.start_main_~x1~0 + 21 Supporting invariants [] [2019-01-01 21:34:58,195 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:58,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:58,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:58,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-01 21:34:58,372 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:58,373 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 3 states. [2019-01-01 21:34:58,404 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 25 states and 28 transitions. Complement of second has 4 states. [2019-01-01 21:34:58,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:34:58,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 12 letters. [2019-01-01 21:34:58,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:58,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 13 letters. Loop has 12 letters. [2019-01-01 21:34:58,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:58,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 24 letters. [2019-01-01 21:34:58,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:58,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2019-01-01 21:34:58,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:34:58,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 27 transitions. [2019-01-01 21:34:58,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:34:58,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-01 21:34:58,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-01-01 21:34:58,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:58,413 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-01 21:34:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-01-01 21:34:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2019-01-01 21:34:58,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:34:58,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-01-01 21:34:58,415 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-01 21:34:58,416 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-01 21:34:58,416 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 21:34:58,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-01-01 21:34:58,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:34:58,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:58,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:58,417 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:34:58,417 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:34:58,417 INFO L794 eck$LassoCheckResult]: Stem: 507#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 508#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 510#L21-2 [2019-01-01 21:34:58,418 INFO L796 eck$LassoCheckResult]: Loop: 510#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 510#L21-2 [2019-01-01 21:34:58,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:58,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-01 21:34:58,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:58,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:58,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:58,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:58,431 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-01 21:34:58,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:58,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:58,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:58,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:58,442 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-01 21:34:58,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:58,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:58,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,498 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:58,498 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:58,498 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:58,498 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:58,498 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:58,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:58,499 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:58,499 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:58,499 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2_true-termination_true-no-overflow.c_Iteration11_Loop [2019-01-01 21:34:58,499 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:58,499 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:58,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:58,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:58,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:58,604 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:58,604 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 [2019-01-01 21:34:58,608 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:58,608 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:58,627 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:58,628 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=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 [2019-01-01 21:34:58,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:58,633 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:58,652 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:58,652 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:34:58,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:58,667 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:34:58,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:58,716 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:58,761 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:58,764 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:58,764 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:58,764 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:58,764 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:58,764 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:58,765 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:58,765 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:58,765 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:58,765 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2_true-termination_true-no-overflow.c_Iteration11_Loop [2019-01-01 21:34:58,765 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:58,765 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:58,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:58,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:58,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:58,836 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:58,836 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:58,837 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 [2019-01-01 21:34:58,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:58,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:58,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:58,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:58,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:58,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:58,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:58,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 [2019-01-01 21:34:58,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:58,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:58,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:58,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:58,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:58,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:58,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:58,850 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 [2019-01-01 21:34:58,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:58,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:58,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:58,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:58,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:58,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:58,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:58,854 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:58,856 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:58,857 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:58,857 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:58,857 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:58,857 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:58,858 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] [2019-01-01 21:34:58,858 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:58,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:58,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:58,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:58,904 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:34:58,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 2 states. [2019-01-01 21:34:58,927 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 31 states and 36 transitions. Complement of second has 5 states. [2019-01-01 21:34:58,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:34:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:34:58,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2019-01-01 21:34:58,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:58,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-01 21:34:58,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:58,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:34:58,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:58,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2019-01-01 21:34:58,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:34:58,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 31 transitions. [2019-01-01 21:34:58,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-01 21:34:58,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-01 21:34:58,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2019-01-01 21:34:58,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:58,932 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-01 21:34:58,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2019-01-01 21:34:58,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-01-01 21:34:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:34:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-01 21:34:58,935 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 21:34:58,935 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 21:34:58,935 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 21:34:58,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-01-01 21:34:58,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:34:58,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:58,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:58,937 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 2, 1, 1, 1] [2019-01-01 21:34:58,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:34:58,937 INFO L794 eck$LassoCheckResult]: Stem: 582#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 583#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 584#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 588#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 596#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 595#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 594#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 593#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 592#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 591#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 590#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 589#L21-2 assume !(main_~x2~0 > 1); 587#L21-3 main_~x1~0 := 1 + main_~x1~0; 585#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 586#L21-2 [2019-01-01 21:34:58,937 INFO L796 eck$LassoCheckResult]: Loop: 586#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 586#L21-2 [2019-01-01 21:34:58,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:58,938 INFO L82 PathProgramCache]: Analyzing trace with hash 315954203, now seen corresponding path program 2 times [2019-01-01 21:34:58,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:58,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:58,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:58,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:58,957 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-01 21:34:58,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:58,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:58,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:58,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:58,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1204645720, now seen corresponding path program 3 times [2019-01-01 21:34:58,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:58,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:58,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:58,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:59,025 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:59,025 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:59,025 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:59,025 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:59,025 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:59,025 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:59,026 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:59,026 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:59,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2_true-termination_true-no-overflow.c_Iteration12_Loop [2019-01-01 21:34:59,026 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:59,026 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:59,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:59,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:59,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:59,120 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:59,120 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2019-01-01 21:34:59,127 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:59,127 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:59,149 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:59,149 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:59,155 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:59,155 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:59,178 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:59,178 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:59,199 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:59,201 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:59,201 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:59,201 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:59,201 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:59,201 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:59,202 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:59,202 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:59,202 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:59,202 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2_true-termination_true-no-overflow.c_Iteration12_Loop [2019-01-01 21:34:59,202 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:59,202 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:59,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:59,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:59,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:59,685 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:59,685 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:59,685 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 [2019-01-01 21:34:59,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:59,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:59,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:59,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:59,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:59,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:59,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:59,709 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 [2019-01-01 21:34:59,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:59,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:59,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:59,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:59,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:59,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:59,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:59,730 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:59,735 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:59,738 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:59,739 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:59,739 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:59,739 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:59,739 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] [2019-01-01 21:34:59,740 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:59,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:59,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:59,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:59,819 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:34:59,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-01 21:34:59,836 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2019-01-01 21:34:59,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:34:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:34:59,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2019-01-01 21:34:59,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:59,839 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:59,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:59,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:59,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:59,890 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:34:59,890 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-01 21:34:59,952 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2019-01-01 21:34:59,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:34:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:34:59,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2019-01-01 21:34:59,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:59,954 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:00,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:00,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:35:00,010 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:35:00,011 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-01 21:35:00,032 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 18 states and 20 transitions. Complement of second has 4 states. [2019-01-01 21:35:00,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:35:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:35:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:35:00,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 1 letters. [2019-01-01 21:35:00,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:00,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 1 letters. [2019-01-01 21:35:00,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:00,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-01 21:35:00,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:00,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-01-01 21:35:00,039 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:35:00,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-01-01 21:35:00,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:35:00,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:35:00,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:35:00,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:35:00,039 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:35:00,040 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:35:00,040 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:35:00,040 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 21:35:00,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:35:00,040 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:35:00,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:35:00,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:35:00 BoogieIcfgContainer [2019-01-01 21:35:00,048 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:35:00,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:35:00,049 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:35:00,049 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:35:00,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:53" (3/4) ... [2019-01-01 21:35:00,054 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:35:00,054 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:35:00,055 INFO L168 Benchmark]: Toolchain (without parser) took 7136.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -218.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:35:00,057 INFO L168 Benchmark]: CDTParser took 0.16 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. [2019-01-01 21:35:00,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.54 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:00,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.74 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:35:00,060 INFO L168 Benchmark]: Boogie Preprocessor took 20.66 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:35:00,060 INFO L168 Benchmark]: RCFGBuilder took 310.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:00,061 INFO L168 Benchmark]: BuchiAutomizer took 6494.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -60.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:00,063 INFO L168 Benchmark]: Witness Printer took 5.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:35:00,068 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.16 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 261.54 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.74 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.66 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 310.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6494.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -60.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. 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 12 terminating modules (9 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * x1 + 21 and consists of 3 locations. One deterministic module has affine ranking function x2 and consists of 3 locations. One nondeterministic module has affine ranking function x2 and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 4.9s. Construction of modules took 0.6s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 45/45 HoareTripleCheckerStatistics: 62 SDtfs, 21 SDslu, 50 SDs, 0 SdLazy, 157 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax203 hnf98 lsp42 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...