./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer --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 a5e4c58569d8caa47946d30f6cb501096837aef1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:17:54,426 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:17:54,427 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:17:54,434 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:17:54,434 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:17:54,435 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:17:54,436 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:17:54,437 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:17:54,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:17:54,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:17:54,439 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:17:54,439 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:17:54,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:17:54,441 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:17:54,442 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:17:54,442 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:17:54,443 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:17:54,444 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:17:54,445 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:17:54,447 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:17:54,447 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:17:54,448 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:17:54,450 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:17:54,450 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:17:54,450 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:17:54,451 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:17:54,451 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:17:54,452 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:17:54,452 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:17:54,453 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:17:54,453 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:17:54,454 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:17:54,454 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:17:54,454 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:17:54,455 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:17:54,455 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:17:54,455 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 10:17:54,464 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:17:54,464 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:17:54,465 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:17:54,465 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:17:54,465 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:17:54,466 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:17:54,466 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:17:54,466 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:17:54,466 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:17:54,466 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:17:54,466 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:17:54,466 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:17:54,467 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:17:54,467 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:17:54,467 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:17:54,467 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:17:54,467 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:17:54,467 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:17:54,467 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:17:54,467 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:17:54,468 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:17:54,468 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:17:54,468 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:17:54,468 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:17:54,468 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:17:54,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:17:54,468 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:17:54,469 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:17:54,469 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:17:54,471 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer 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 -> a5e4c58569d8caa47946d30f6cb501096837aef1 [2018-11-18 10:17:54,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:17:54,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:17:54,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:17:54,509 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:17:54,509 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:17:54,510 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2018-11-18 10:17:54,555 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/data/54a7bf179/f44bc6ae4983453dab2e8a2b54602f18/FLAGc4da2418d [2018-11-18 10:17:54,865 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:17:54,865 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/sv-benchmarks/c/termination-restricted-15/McCarthyIterative_true-termination_true-no-overflow.c [2018-11-18 10:17:54,869 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/data/54a7bf179/f44bc6ae4983453dab2e8a2b54602f18/FLAGc4da2418d [2018-11-18 10:17:54,877 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/data/54a7bf179/f44bc6ae4983453dab2e8a2b54602f18 [2018-11-18 10:17:54,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:17:54,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:17:54,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:17:54,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:17:54,885 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:17:54,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:17:54" (1/1) ... [2018-11-18 10:17:54,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78bb2e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:54, skipping insertion in model container [2018-11-18 10:17:54,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:17:54" (1/1) ... [2018-11-18 10:17:54,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:17:54,910 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:17:55,023 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:17:55,025 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:17:55,035 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:17:55,044 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:17:55,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:55 WrapperNode [2018-11-18 10:17:55,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:17:55,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:17:55,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:17:55,045 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:17:55,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:55" (1/1) ... [2018-11-18 10:17:55,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:55" (1/1) ... [2018-11-18 10:17:55,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:17:55,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:17:55,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:17:55,065 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:17:55,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:55" (1/1) ... [2018-11-18 10:17:55,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:55" (1/1) ... [2018-11-18 10:17:55,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:55" (1/1) ... [2018-11-18 10:17:55,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:55" (1/1) ... [2018-11-18 10:17:55,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:55" (1/1) ... [2018-11-18 10:17:55,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:55" (1/1) ... [2018-11-18 10:17:55,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:55" (1/1) ... [2018-11-18 10:17:55,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:17:55,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:17:55,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:17:55,076 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:17:55,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:55,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:17:55,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:17:55,238 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:17:55,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:17:55 BoogieIcfgContainer [2018-11-18 10:17:55,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:17:55,239 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:17:55,239 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:17:55,241 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:17:55,242 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:17:55,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:17:54" (1/3) ... [2018-11-18 10:17:55,243 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e1322c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:17:55, skipping insertion in model container [2018-11-18 10:17:55,243 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:17:55,243 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:55" (2/3) ... [2018-11-18 10:17:55,243 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e1322c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:17:55, skipping insertion in model container [2018-11-18 10:17:55,243 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:17:55,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:17:55" (3/3) ... [2018-11-18 10:17:55,245 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative_true-termination_true-no-overflow.c [2018-11-18 10:17:55,279 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:17:55,280 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:17:55,280 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:17:55,280 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:17:55,280 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:17:55,280 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:17:55,280 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:17:55,280 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:17:55,280 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:17:55,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-18 10:17:55,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 10:17:55,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:17:55,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:17:55,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:17:55,308 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:17:55,308 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:17:55,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-18 10:17:55,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 10:17:55,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:17:55,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:17:55,309 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:17:55,309 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:17:55,314 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 4#L12-2true [2018-11-18 10:17:55,314 INFO L796 eck$LassoCheckResult]: Loop: 4#L12-2true assume true; 5#L11-1true assume !!(main_~c~0 > 0); 8#L12true assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 4#L12-2true [2018-11-18 10:17:55,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:55,317 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 10:17:55,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:55,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:55,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:55,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:55,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:55,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:55,375 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 1 times [2018-11-18 10:17:55,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:55,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:55,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:55,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:55,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:55,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:55,387 INFO L82 PathProgramCache]: Analyzing trace with hash 28694888, now seen corresponding path program 1 times [2018-11-18 10:17:55,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:55,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:55,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:55,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:55,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:55,441 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:55,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:55,442 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:55,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:55,442 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:17:55,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:55,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:55,442 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:55,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-18 10:17:55,442 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:55,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:55,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:55,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:55,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:55,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:55,586 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:55,587 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:55,590 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:17:55,590 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:55,609 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:17:55,609 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:17:55,626 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:17:55,627 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:55,627 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:55,627 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:55,628 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:55,628 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:17:55,628 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:55,628 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:55,628 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:55,628 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-18 10:17:55,628 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:55,628 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:55,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:55,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:55,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:55,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:55,704 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:55,707 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:17:55,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:17:55,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:17:55,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:17:55,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:17:55,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:17:55,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:17:55,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:17:55,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:17:55,718 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:17:55,722 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:17:55,723 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 10:17:55,724 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:17:55,724 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:17:55,725 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:17:55,725 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2018-11-18 10:17:55,726 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:17:55,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:55,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:55,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:55,776 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 [2018-11-18 10:17:55,777 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 3 states. [2018-11-18 10:17:55,801 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 3 states. Result 27 states and 32 transitions. Complement of second has 6 states. [2018-11-18 10:17:55,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 10:17:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 10:17:55,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-18 10:17:55,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 10:17:55,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:55,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 10:17:55,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:55,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 10:17:55,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:55,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-18 10:17:55,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 10:17:55,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 11 states and 14 transitions. [2018-11-18 10:17:55,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-18 10:17:55,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 10:17:55,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-18 10:17:55,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:17:55,812 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 10:17:55,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-18 10:17:55,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-18 10:17:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 10:17:55,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-18 10:17:55,829 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 10:17:55,829 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 10:17:55,829 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:17:55,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-18 10:17:55,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 10:17:55,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:17:55,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:17:55,831 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 10:17:55,831 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:17:55,831 INFO L794 eck$LassoCheckResult]: Stem: 84#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 75#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 76#L12-2 assume true; 77#L11-1 assume !!(main_~c~0 > 0); 78#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 81#L12-2 [2018-11-18 10:17:55,831 INFO L796 eck$LassoCheckResult]: Loop: 81#L12-2 assume true; 82#L11-1 assume !!(main_~c~0 > 0); 85#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 81#L12-2 [2018-11-18 10:17:55,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:55,831 INFO L82 PathProgramCache]: Analyzing trace with hash 28694886, now seen corresponding path program 1 times [2018-11-18 10:17:55,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:55,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:55,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:55,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:55,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:55,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:55,838 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 2 times [2018-11-18 10:17:55,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:55,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:55,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:55,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:55,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:55,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:55,844 INFO L82 PathProgramCache]: Analyzing trace with hash 150863077, now seen corresponding path program 1 times [2018-11-18 10:17:55,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:55,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:55,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:55,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:55,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:55,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:55,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:17:55,889 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:55,889 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:55,889 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:55,889 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:55,889 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:17:55,889 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:55,889 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:55,889 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:55,889 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-18 10:17:55,889 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:55,889 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:55,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:55,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:55,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:55,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:55,951 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:55,951 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:55,953 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:17:55,953 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:17:55,971 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:17:55,971 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 /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:55,973 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:17:55,973 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:17:55,988 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:17:55,989 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 /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:55,991 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:17:55,991 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:56,007 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:17:56,007 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:17:56,024 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:17:56,025 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:56,025 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:56,025 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:56,025 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:56,025 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:17:56,025 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:56,026 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:56,026 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:56,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-18 10:17:56,026 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:56,026 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:56,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,074 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:56,074 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:17:56,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:17:56,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:17:56,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:17:56,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:17:56,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:17:56,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:17:56,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:17:56,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:17:56,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:17:56,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:17:56,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:17:56,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:17:56,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:17:56,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:17:56,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:17:56,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:17:56,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:17:56,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:17:56,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:17:56,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:17:56,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:17:56,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:17:56,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:17:56,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:17:56,100 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:17:56,103 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:17:56,103 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 10:17:56,104 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:17:56,104 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:17:56,104 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:17:56,104 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2018-11-18 10:17:56,104 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:17:56,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:56,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:56,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:56,147 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 [2018-11-18 10:17:56,147 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 10:17:56,153 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 17 states and 22 transitions. Complement of second has 5 states. [2018-11-18 10:17:56,154 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 [2018-11-18 10:17:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 10:17:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-18 10:17:56,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 10:17:56,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:56,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 10:17:56,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:56,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-18 10:17:56,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:56,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-18 10:17:56,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 10:17:56,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2018-11-18 10:17:56,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 10:17:56,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 10:17:56,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-18 10:17:56,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:17:56,157 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-18 10:17:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-18 10:17:56,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 10:17:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 10:17:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-11-18 10:17:56,159 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-18 10:17:56,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:17:56,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:17:56,162 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2018-11-18 10:17:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:56,174 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-18 10:17:56,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:17:56,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-11-18 10:17:56,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 10:17:56,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 23 transitions. [2018-11-18 10:17:56,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 10:17:56,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 10:17:56,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-11-18 10:17:56,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:17:56,177 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 10:17:56,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-11-18 10:17:56,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-18 10:17:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 10:17:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-18 10:17:56,179 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 10:17:56,179 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 10:17:56,179 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:17:56,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-18 10:17:56,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 10:17:56,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:17:56,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:17:56,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1] [2018-11-18 10:17:56,180 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:17:56,180 INFO L794 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 191#L12-2 assume true; 196#L11-1 assume !!(main_~c~0 > 0); 198#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 194#L12-2 assume true; 195#L11-1 assume !!(main_~c~0 > 0); 197#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 200#L12-2 assume true; 201#L11-1 assume !!(main_~c~0 > 0); 204#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 192#L12-2 [2018-11-18 10:17:56,180 INFO L796 eck$LassoCheckResult]: Loop: 192#L12-2 assume true; 193#L11-1 assume !!(main_~c~0 > 0); 203#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 192#L12-2 [2018-11-18 10:17:56,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,181 INFO L82 PathProgramCache]: Analyzing trace with hash -693878072, now seen corresponding path program 2 times [2018-11-18 10:17:56,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:56,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:56,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:56,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,192 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 3 times [2018-11-18 10:17:56,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:56,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:56,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:56,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,199 INFO L82 PathProgramCache]: Analyzing trace with hash 355958851, now seen corresponding path program 3 times [2018-11-18 10:17:56,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:56,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:56,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:56,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 10:17:56,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:17:56,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/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 [2018-11-18 10:17:56,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 10:17:56,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 10:17:56,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:17:56,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 10:17:56,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:17:56,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-18 10:17:56,312 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:56,312 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:56,312 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:56,312 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:56,312 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:17:56,312 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:56,312 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:56,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:56,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-18 10:17:56,313 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:56,313 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:56,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,366 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:56,366 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:56,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:17:56,370 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:56,387 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:17:56,387 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:17:56,394 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:17:56,394 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:56,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:17:56,409 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:56,427 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:17:56,427 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:17:56,446 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:17:56,447 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:56,447 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:56,447 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:56,447 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:56,447 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:17:56,447 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:56,447 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:56,447 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:56,447 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-18 10:17:56,447 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:56,448 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:56,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,508 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:56,509 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:17:56,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:17:56,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:17:56,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:17:56,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:17:56,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:17:56,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:17:56,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:17:56,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:17:56,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:17:56,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:17:56,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:17:56,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:17:56,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:17:56,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:17:56,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:17:56,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:17:56,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:17:56,517 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:17:56,521 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:17:56,521 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 10:17:56,521 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:17:56,521 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:17:56,522 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:17:56,522 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2018-11-18 10:17:56,522 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:17:56,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:56,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:56,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:56,549 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 [2018-11-18 10:17:56,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-18 10:17:56,556 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 5 states. [2018-11-18 10:17:56,556 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 [2018-11-18 10:17:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 10:17:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-18 10:17:56,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 10:17:56,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:56,557 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:56,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:56,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:56,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:56,578 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 [2018-11-18 10:17:56,578 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-18 10:17:56,584 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 5 states. [2018-11-18 10:17:56,584 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 [2018-11-18 10:17:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 10:17:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-18 10:17:56,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 10:17:56,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:56,585 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:56,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:56,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:56,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:56,604 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 [2018-11-18 10:17:56,604 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-18 10:17:56,611 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 24 states and 31 transitions. Complement of second has 4 states. [2018-11-18 10:17:56,611 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 [2018-11-18 10:17:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 10:17:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-18 10:17:56,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 10:17:56,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:56,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-18 10:17:56,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:56,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-18 10:17:56,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:56,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2018-11-18 10:17:56,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 10:17:56,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 25 transitions. [2018-11-18 10:17:56,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 10:17:56,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 10:17:56,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-18 10:17:56,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:17:56,615 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-18 10:17:56,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-18 10:17:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 9. [2018-11-18 10:17:56,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 10:17:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-18 10:17:56,617 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-18 10:17:56,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:17:56,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:17:56,617 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-11-18 10:17:56,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:56,631 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-18 10:17:56,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:17:56,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2018-11-18 10:17:56,632 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 10:17:56,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 20 transitions. [2018-11-18 10:17:56,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 10:17:56,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 10:17:56,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-11-18 10:17:56,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:17:56,632 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 10:17:56,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-11-18 10:17:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-11-18 10:17:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 10:17:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-18 10:17:56,634 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 10:17:56,634 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 10:17:56,634 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:17:56,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-18 10:17:56,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 10:17:56,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:17:56,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:17:56,635 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:17:56,635 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-18 10:17:56,635 INFO L794 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 501#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 502#L12-2 [2018-11-18 10:17:56,635 INFO L796 eck$LassoCheckResult]: Loop: 502#L12-2 assume true; 503#L11-1 assume !!(main_~c~0 > 0); 514#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 504#L12-2 assume true; 506#L11-1 assume !!(main_~c~0 > 0); 511#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 502#L12-2 [2018-11-18 10:17:56,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,636 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 10:17:56,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:56,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:56,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:56,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1070873439, now seen corresponding path program 1 times [2018-11-18 10:17:56,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:56,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:56,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:56,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,646 INFO L82 PathProgramCache]: Analyzing trace with hash 150922657, now seen corresponding path program 4 times [2018-11-18 10:17:56,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:56,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:56,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:56,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,690 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:56,690 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:56,691 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:56,691 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:56,691 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:17:56,691 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:56,691 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:56,691 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:56,691 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-18 10:17:56,691 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:56,691 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:56,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,735 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:56,735 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:56,739 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:17:56,739 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:56,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:17:56,755 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:17:56,758 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:17:56,771 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:56,772 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:56,772 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:56,772 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:56,772 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:17:56,772 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:56,772 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:56,772 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:56,772 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-18 10:17:56,772 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:56,772 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:56,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,818 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:56,818 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:17:56,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:17:56,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:17:56,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:17:56,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:17:56,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:17:56,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:17:56,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:17:56,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:17:56,822 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:17:56,823 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:17:56,823 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 10:17:56,824 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:17:56,824 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:17:56,824 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:17:56,824 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 201 Supporting invariants [] [2018-11-18 10:17:56,824 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:17:56,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:56,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:56,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:56,863 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 [2018-11-18 10:17:56,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-18 10:17:56,870 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 33 states and 39 transitions. Complement of second has 5 states. [2018-11-18 10:17:56,871 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 [2018-11-18 10:17:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:17:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-11-18 10:17:56,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 10:17:56,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:56,872 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:56,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:56,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:56,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:56,893 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 10:17:56,893 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-18 10:17:56,906 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 39 states and 47 transitions. Complement of second has 7 states. [2018-11-18 10:17:56,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:17:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:17:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-18 10:17:56,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 10:17:56,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:56,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 10:17:56,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:56,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-18 10:17:56,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:56,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2018-11-18 10:17:56,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 10:17:56,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 25 states and 30 transitions. [2018-11-18 10:17:56,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-18 10:17:56,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 10:17:56,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-18 10:17:56,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:17:56,908 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-18 10:17:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-18 10:17:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-11-18 10:17:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 10:17:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-11-18 10:17:56,909 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-18 10:17:56,909 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-18 10:17:56,909 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:17:56,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2018-11-18 10:17:56,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 10:17:56,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:17:56,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:17:56,910 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1] [2018-11-18 10:17:56,910 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:17:56,910 INFO L794 eck$LassoCheckResult]: Stem: 673#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 665#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 666#L12-2 assume true; 667#L11-1 assume !!(main_~c~0 > 0); 685#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 684#L12-2 assume true; 677#L11-1 assume !!(main_~c~0 > 0); 683#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 682#L12-2 assume true; 681#L11-1 assume !!(main_~c~0 > 0); 680#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 676#L12-2 assume true; 669#L11-1 [2018-11-18 10:17:56,910 INFO L796 eck$LassoCheckResult]: Loop: 669#L11-1 assume !!(main_~c~0 > 0); 670#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 674#L12-2 assume true; 669#L11-1 [2018-11-18 10:17:56,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,911 INFO L82 PathProgramCache]: Analyzing trace with hash -33536704, now seen corresponding path program 5 times [2018-11-18 10:17:56,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:56,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:56,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:56,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,917 INFO L82 PathProgramCache]: Analyzing trace with hash 41794, now seen corresponding path program 1 times [2018-11-18 10:17:56,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:56,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:56,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:56,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:56,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1635443107, now seen corresponding path program 6 times [2018-11-18 10:17:56,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:56,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:56,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:56,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:56,956 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:56,956 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:56,956 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:56,956 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:56,956 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:17:56,956 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:56,956 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:56,956 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:56,957 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-18 10:17:56,957 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:56,957 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:56,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:56,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,008 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:57,008 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:57,010 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:17:57,010 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:57,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:17:57,027 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:17:57,045 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:17:57,046 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:57,046 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:57,046 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:57,046 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:57,046 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:17:57,046 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:57,046 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:57,046 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:57,046 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-18 10:17:57,046 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:57,046 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:57,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,080 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:57,081 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:17:57,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:17:57,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:17:57,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:17:57,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:17:57,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:17:57,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:17:57,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:17:57,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:17:57,084 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:17:57,085 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:17:57,085 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:17:57,085 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:17:57,085 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:17:57,085 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:17:57,085 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-18 10:17:57,086 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:17:57,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:57,128 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 [2018-11-18 10:17:57,128 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 10:17:57,131 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 24 states and 29 transitions. Complement of second has 5 states. [2018-11-18 10:17:57,131 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 [2018-11-18 10:17:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:17:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-18 10:17:57,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 10:17:57,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:57,132 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:57,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:57,150 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 10:17:57,150 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 10:17:57,153 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 24 states and 29 transitions. Complement of second has 5 states. [2018-11-18 10:17:57,154 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 [2018-11-18 10:17:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:17:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-18 10:17:57,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 10:17:57,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:57,154 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:57,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:57,172 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 2 loop predicates [2018-11-18 10:17:57,172 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 10:17:57,176 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 39 states and 47 transitions. Complement of second has 6 states. [2018-11-18 10:17:57,176 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 [2018-11-18 10:17:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:17:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-18 10:17:57,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 10:17:57,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:57,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-18 10:17:57,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:57,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 10:17:57,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:57,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2018-11-18 10:17:57,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 10:17:57,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 26 states and 31 transitions. [2018-11-18 10:17:57,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-18 10:17:57,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-18 10:17:57,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2018-11-18 10:17:57,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:17:57,180 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-18 10:17:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2018-11-18 10:17:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-11-18 10:17:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 10:17:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-18 10:17:57,181 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-18 10:17:57,181 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-18 10:17:57,181 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:17:57,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-18 10:17:57,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 10:17:57,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:17:57,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:17:57,182 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1] [2018-11-18 10:17:57,182 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-18 10:17:57,182 INFO L794 eck$LassoCheckResult]: Stem: 949#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 942#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 943#L12-2 assume true; 944#L11-1 assume !!(main_~c~0 > 0); 948#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 962#L12-2 assume true; 952#L11-1 assume !!(main_~c~0 > 0); 959#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 958#L12-2 assume true; 957#L11-1 assume !!(main_~c~0 > 0); 955#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 951#L12-2 assume true; 946#L11-1 [2018-11-18 10:17:57,182 INFO L796 eck$LassoCheckResult]: Loop: 946#L11-1 assume !!(main_~c~0 > 0); 947#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 960#L12-2 assume true; 956#L11-1 assume !!(main_~c~0 > 0); 953#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 954#L12-2 assume true; 946#L11-1 [2018-11-18 10:17:57,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,183 INFO L82 PathProgramCache]: Analyzing trace with hash -33536704, now seen corresponding path program 7 times [2018-11-18 10:17:57,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:57,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:57,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:57,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:57,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:57,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 2 times [2018-11-18 10:17:57,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:57,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:57,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:57,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:17:57,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:57,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,193 INFO L82 PathProgramCache]: Analyzing trace with hash -623393122, now seen corresponding path program 8 times [2018-11-18 10:17:57,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:57,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:57,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:57,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:57,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:57,229 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:57,229 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:57,229 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:57,229 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:57,229 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:17:57,229 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:57,229 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:57,229 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:57,229 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-18 10:17:57,229 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:57,229 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:57,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,271 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:57,271 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:57,274 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:17:57,274 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:57,292 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:17:57,292 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:17:57,294 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:17:57,308 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:57,308 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:57,308 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:57,308 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:57,308 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:17:57,308 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:57,308 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:57,309 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:57,309 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-18 10:17:57,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:57,309 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:57,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,345 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:57,345 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:17:57,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:17:57,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:17:57,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:17:57,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:17:57,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:17:57,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:17:57,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:17:57,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:17:57,348 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:17:57,349 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:17:57,349 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 10:17:57,349 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:17:57,350 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:17:57,350 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:17:57,350 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 221 Supporting invariants [] [2018-11-18 10:17:57,350 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:17:57,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:57,381 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 10:17:57,381 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 10:17:57,391 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 43 states and 49 transitions. Complement of second has 7 states. [2018-11-18 10:17:57,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:17:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:17:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-18 10:17:57,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 10:17:57,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:57,392 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:57,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:57,418 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 10:17:57,418 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 10:17:57,435 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 42 states and 49 transitions. Complement of second has 9 states. [2018-11-18 10:17:57,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 10:17:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:17:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-18 10:17:57,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 10:17:57,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:57,436 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:57,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:57,464 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 3 loop predicates [2018-11-18 10:17:57,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 10:17:57,474 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 70 states and 82 transitions. Complement of second has 13 states. [2018-11-18 10:17:57,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:17:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:17:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 10:17:57,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 10:17:57,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:57,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-18 10:17:57,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:57,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 12 letters. [2018-11-18 10:17:57,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:57,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 82 transitions. [2018-11-18 10:17:57,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-18 10:17:57,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 47 states and 56 transitions. [2018-11-18 10:17:57,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-18 10:17:57,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 10:17:57,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 56 transitions. [2018-11-18 10:17:57,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:17:57,478 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-11-18 10:17:57,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 56 transitions. [2018-11-18 10:17:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2018-11-18 10:17:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 10:17:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2018-11-18 10:17:57,481 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-18 10:17:57,481 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-18 10:17:57,481 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 10:17:57,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2018-11-18 10:17:57,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-18 10:17:57,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:17:57,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:17:57,483 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 3, 3, 1, 1] [2018-11-18 10:17:57,483 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2018-11-18 10:17:57,484 INFO L794 eck$LassoCheckResult]: Stem: 1344#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1335#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1336#L12-2 assume true; 1355#L11-1 assume !!(main_~c~0 > 0); 1352#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1353#L12-2 assume true; 1348#L11-1 assume !!(main_~c~0 > 0); 1350#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1347#L12-2 assume true; 1346#L11-1 assume !!(main_~c~0 > 0); 1345#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1340#L12-2 assume true; 1341#L11-1 assume !!(main_~c~0 > 0); 1366#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1367#L12-2 assume true; 1365#L11-1 assume !!(main_~c~0 > 0); 1364#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1363#L12-2 assume true; 1361#L11-1 assume !!(main_~c~0 > 0); 1362#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1359#L12-2 assume true; 1360#L11-1 [2018-11-18 10:17:57,484 INFO L796 eck$LassoCheckResult]: Loop: 1360#L11-1 assume !!(main_~c~0 > 0); 1366#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1367#L12-2 assume true; 1365#L11-1 assume !!(main_~c~0 > 0); 1364#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1363#L12-2 assume true; 1361#L11-1 assume !!(main_~c~0 > 0); 1362#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1359#L12-2 assume true; 1360#L11-1 [2018-11-18 10:17:57,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash -67744575, now seen corresponding path program 9 times [2018-11-18 10:17:57,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:57,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:57,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:57,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:57,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:17:57,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:57,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:17:57,513 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:17:57,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1348868896, now seen corresponding path program 3 times [2018-11-18 10:17:57,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:57,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:57,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:57,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:57,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:57,553 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:57,553 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:57,553 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:57,553 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:57,553 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:17:57,553 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:57,553 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:57,553 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:57,554 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-18 10:17:57,554 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:57,554 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:57,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,600 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:57,600 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:57,604 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:17:57,604 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/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 [2018-11-18 10:17:57,624 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:17:57,624 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:17:57,626 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:17:57,644 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:57,644 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:57,644 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:57,644 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:57,644 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:17:57,644 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:57,644 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:57,644 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:57,644 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-18 10:17:57,644 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:57,644 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:57,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:57,687 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:57,687 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:17:57,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:17:57,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:17:57,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:17:57,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:17:57,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:17:57,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:17:57,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:17:57,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:17:57,690 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:17:57,692 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:17:57,692 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:17:57,692 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:17:57,692 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:17:57,692 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:17:57,692 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-18 10:17:57,693 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:17:57,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:57,731 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 10:17:57,731 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-18 10:17:57,736 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 6 states. Result 39 states and 48 transitions. Complement of second has 5 states. [2018-11-18 10:17:57,736 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 [2018-11-18 10:17:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:17:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-18 10:17:57,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-18 10:17:57,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:57,737 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:57,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,783 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:57,784 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 10:17:57,784 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-18 10:17:57,787 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 6 states. Result 39 states and 48 transitions. Complement of second has 5 states. [2018-11-18 10:17:57,787 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 [2018-11-18 10:17:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:17:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-18 10:17:57,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-18 10:17:57,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:57,788 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:57,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:57,826 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 4 loop predicates [2018-11-18 10:17:57,826 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-18 10:17:57,832 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 6 states. Result 72 states and 91 transitions. Complement of second has 6 states. [2018-11-18 10:17:57,837 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 [2018-11-18 10:17:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:17:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-18 10:17:57,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-18 10:17:57,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:57,838 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:57,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:57,886 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 10:17:57,887 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-18 10:17:57,923 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 6 states. Result 131 states and 151 transitions. Complement of second has 19 states. [2018-11-18 10:17:57,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 10:17:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:17:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-18 10:17:57,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-18 10:17:57,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:57,924 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:57,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:57,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:57,975 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 10:17:57,976 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-18 10:17:58,045 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,045 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,050 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,050 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,050 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,067 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,073 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,110 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,111 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,116 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,116 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,116 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,131 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,131 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,131 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,132 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,132 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:58,133 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 6 states. Result 982 states and 1487 transitions. Complement of second has 138 states 12 powerset states126 rank states. The highest rank that occured is 7 [2018-11-18 10:17:58,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 10:17:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:17:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2018-11-18 10:17:58,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-18 10:17:58,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:58,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 30 letters. Loop has 9 letters. [2018-11-18 10:17:58,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:58,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-18 10:17:58,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:58,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 982 states and 1487 transitions. [2018-11-18 10:17:58,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 97 [2018-11-18 10:17:58,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 982 states to 623 states and 1012 transitions. [2018-11-18 10:17:58,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-18 10:17:58,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 427 [2018-11-18 10:17:58,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 623 states and 1012 transitions. [2018-11-18 10:17:58,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:17:58,161 INFO L705 BuchiCegarLoop]: Abstraction has 623 states and 1012 transitions. [2018-11-18 10:17:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states and 1012 transitions. [2018-11-18 10:17:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 145. [2018-11-18 10:17:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 10:17:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 213 transitions. [2018-11-18 10:17:58,175 INFO L728 BuchiCegarLoop]: Abstraction has 145 states and 213 transitions. [2018-11-18 10:17:58,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:17:58,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:17:58,176 INFO L87 Difference]: Start difference. First operand 145 states and 213 transitions. Second operand 5 states. [2018-11-18 10:17:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:58,192 INFO L93 Difference]: Finished difference Result 191 states and 262 transitions. [2018-11-18 10:17:58,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:17:58,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 262 transitions. [2018-11-18 10:17:58,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2018-11-18 10:17:58,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 163 states and 222 transitions. [2018-11-18 10:17:58,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-18 10:17:58,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-18 10:17:58,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 163 states and 222 transitions. [2018-11-18 10:17:58,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:17:58,196 INFO L705 BuchiCegarLoop]: Abstraction has 163 states and 222 transitions. [2018-11-18 10:17:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 222 transitions. [2018-11-18 10:17:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 135. [2018-11-18 10:17:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 10:17:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 185 transitions. [2018-11-18 10:17:58,204 INFO L728 BuchiCegarLoop]: Abstraction has 135 states and 185 transitions. [2018-11-18 10:17:58,204 INFO L608 BuchiCegarLoop]: Abstraction has 135 states and 185 transitions. [2018-11-18 10:17:58,204 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 10:17:58,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 185 transitions. [2018-11-18 10:17:58,205 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 54 [2018-11-18 10:17:58,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:17:58,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:17:58,205 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1] [2018-11-18 10:17:58,205 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2] [2018-11-18 10:17:58,209 INFO L794 eck$LassoCheckResult]: Stem: 3639#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3640#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 3698#L12-2 assume true; 3696#L11-1 assume !!(main_~c~0 > 0); 3691#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 3693#L12-2 assume true; 3655#L11-1 assume !!(main_~c~0 > 0); 3683#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 3653#L12-2 assume true; 3634#L11-1 [2018-11-18 10:17:58,209 INFO L796 eck$LassoCheckResult]: Loop: 3634#L11-1 assume !!(main_~c~0 > 0); 3641#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3642#L12-2 assume true; 3701#L11-1 assume !!(main_~c~0 > 0); 3705#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3704#L12-2 assume true; 3703#L11-1 assume !!(main_~c~0 > 0); 3702#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 3688#L12-2 assume true; 3682#L11-1 assume !!(main_~c~0 > 0); 3647#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 3633#L12-2 assume true; 3634#L11-1 [2018-11-18 10:17:58,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:58,210 INFO L82 PathProgramCache]: Analyzing trace with hash 383635139, now seen corresponding path program 2 times [2018-11-18 10:17:58,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:58,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:58,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:58,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:58,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:58,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:58,219 INFO L82 PathProgramCache]: Analyzing trace with hash 439271425, now seen corresponding path program 4 times [2018-11-18 10:17:58,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:58,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:58,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:58,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:58,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:17:58,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:17:58,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:17:58,234 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:17:58,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:17:58,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:17:58,234 INFO L87 Difference]: Start difference. First operand 135 states and 185 transitions. cyclomatic complexity: 57 Second operand 4 states. [2018-11-18 10:17:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:17:58,254 INFO L93 Difference]: Finished difference Result 173 states and 217 transitions. [2018-11-18 10:17:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:17:58,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 217 transitions. [2018-11-18 10:17:58,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2018-11-18 10:17:58,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 137 states and 173 transitions. [2018-11-18 10:17:58,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-18 10:17:58,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-18 10:17:58,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 173 transitions. [2018-11-18 10:17:58,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:17:58,258 INFO L705 BuchiCegarLoop]: Abstraction has 137 states and 173 transitions. [2018-11-18 10:17:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 173 transitions. [2018-11-18 10:17:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 107. [2018-11-18 10:17:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-18 10:17:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 136 transitions. [2018-11-18 10:17:58,261 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 136 transitions. [2018-11-18 10:17:58,261 INFO L608 BuchiCegarLoop]: Abstraction has 107 states and 136 transitions. [2018-11-18 10:17:58,261 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 10:17:58,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 136 transitions. [2018-11-18 10:17:58,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2018-11-18 10:17:58,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:17:58,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:17:58,262 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1] [2018-11-18 10:17:58,262 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 6, 4] [2018-11-18 10:17:58,263 INFO L794 eck$LassoCheckResult]: Stem: 3955#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3956#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 3947#L12-2 assume true; 4052#L11-1 assume !!(main_~c~0 > 0); 3959#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 3960#L12-2 assume true; 4047#L11-1 assume !!(main_~c~0 > 0); 4045#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 4046#L12-2 assume true; 3953#L11-1 [2018-11-18 10:17:58,263 INFO L796 eck$LassoCheckResult]: Loop: 3953#L11-1 assume !!(main_~c~0 > 0); 3954#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 4043#L12-2 assume true; 4042#L11-1 assume !!(main_~c~0 > 0); 4041#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 4040#L12-2 assume true; 4039#L11-1 assume !!(main_~c~0 > 0); 4030#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 4022#L12-2 assume true; 4019#L11-1 assume !!(main_~c~0 > 0); 4016#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 4015#L12-2 assume true; 4012#L11-1 assume !!(main_~c~0 > 0); 4011#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 4010#L12-2 assume true; 4005#L11-1 assume !!(main_~c~0 > 0); 4009#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 4008#L12-2 assume true; 4007#L11-1 assume !!(main_~c~0 > 0); 4006#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 4003#L12-2 assume true; 4004#L11-1 assume !!(main_~c~0 > 0); 4028#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 4027#L12-2 assume true; 4026#L11-1 assume !!(main_~c~0 > 0); 4025#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 4024#L12-2 assume true; 4023#L11-1 assume !!(main_~c~0 > 0); 4021#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 4020#L12-2 assume true; 3953#L11-1 [2018-11-18 10:17:58,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:58,263 INFO L82 PathProgramCache]: Analyzing trace with hash 383635139, now seen corresponding path program 3 times [2018-11-18 10:17:58,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:58,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:58,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:58,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:58,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:58,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash 748806693, now seen corresponding path program 5 times [2018-11-18 10:17:58,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:58,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:58,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:58,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:17:58,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:58,280 INFO L82 PathProgramCache]: Analyzing trace with hash -867503769, now seen corresponding path program 10 times [2018-11-18 10:17:58,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:17:58,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:17:58,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:58,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:17:58,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:17:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 111 proven. 39 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-18 10:17:58,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:17:58,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:17:58,327 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 10:17:58,338 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 10:17:58,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:17:58,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 152 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:17:58,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:17:58,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 15 [2018-11-18 10:17:58,530 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:58,530 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:58,530 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:58,530 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:58,531 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:17:58,531 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:58,531 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:58,531 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:58,531 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration9_Loop [2018-11-18 10:17:58,531 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:58,531 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:58,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:58,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:58,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:58,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:58,560 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:58,560 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:58,561 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:17:58,562 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:17:58,576 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:17:58,577 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:58,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:17:58,580 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:58,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:17:58,597 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:17:58,811 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:17:58,813 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:17:58,813 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:17:58,813 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:17:58,813 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:17:58,813 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:17:58,813 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:17:58,813 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:17:58,813 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:17:58,813 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration9_Loop [2018-11-18 10:17:58,813 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:17:58,813 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:17:58,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:58,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:58,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:58,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:17:58,843 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:17:58,843 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:17: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 [2018-11-18 10:17:58,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:17:58,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:17:58,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:17:58,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:17:58,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:17:58,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:17:58,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:17:58,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:17:58,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:17:58,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:17:58,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:17:58,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:17:58,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:17:58,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:17:58,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:17:58,850 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:17:58,851 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:17:58,851 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:17:58,851 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:17:58,851 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:17:58,851 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:17:58,852 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-18 10:17:58,852 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:17:58,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:58,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:58,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 76 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:58,927 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2018-11-18 10:17:58,927 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36 Second operand 13 states. [2018-11-18 10:17:58,932 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36. Second operand 13 states. Result 109 states and 138 transitions. Complement of second has 5 states. [2018-11-18 10:17:58,932 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 [2018-11-18 10:17:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 10:17:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-18 10:17:58,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 9 letters. Loop has 30 letters. [2018-11-18 10:17:58,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:58,933 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:58,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:58,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:58,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 76 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:59,031 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 11 loop predicates [2018-11-18 10:17:59,031 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36 Second operand 13 states. [2018-11-18 10:17:59,035 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36. Second operand 13 states. Result 109 states and 138 transitions. Complement of second has 5 states. [2018-11-18 10:17:59,037 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 [2018-11-18 10:17:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 10:17:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-18 10:17:59,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 9 letters. Loop has 30 letters. [2018-11-18 10:17:59,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:59,038 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:59,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:59,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:59,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 76 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:59,117 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 11 loop predicates [2018-11-18 10:17:59,117 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36 Second operand 13 states. [2018-11-18 10:17:59,122 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36. Second operand 13 states. Result 175 states and 205 transitions. Complement of second has 6 states. [2018-11-18 10:17:59,122 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 [2018-11-18 10:17:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 10:17:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-18 10:17:59,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 30 letters. [2018-11-18 10:17:59,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:59,123 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:59,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:59,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:59,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 76 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:59,200 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 11 loop predicates [2018-11-18 10:17:59,200 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36 Second operand 13 states. [2018-11-18 10:17:59,295 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 136 transitions. cyclomatic complexity: 36. Second operand 13 states. Result 592 states and 694 transitions. Complement of second has 81 states. [2018-11-18 10:17:59,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-18 10:17:59,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 10:17:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2018-11-18 10:17:59,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 9 letters. Loop has 30 letters. [2018-11-18 10:17:59,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:59,298 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:17:59,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:17:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:59,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:17:59,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:17:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 76 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:17:59,391 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2018-11-18 10:17:59,391 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 107 states and 136 transitions. cyclomatic complexity: 36 Second operand 13 states. [2018-11-18 10:17:59,453 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,456 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,456 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,456 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,456 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,457 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,458 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,460 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,460 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,460 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,460 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,460 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,535 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,537 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,537 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,537 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,547 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,549 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,549 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,549 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,549 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,550 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,550 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,550 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,550 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,552 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,552 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,553 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,553 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,556 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,558 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,559 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,559 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,559 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,559 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,560 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,560 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,560 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,649 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,649 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,650 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,652 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,653 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,653 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,653 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,653 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,654 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,654 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,654 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,654 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,654 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,657 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,657 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,659 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,661 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,662 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,662 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,662 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,662 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,663 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,663 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,663 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,663 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,663 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,698 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,703 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,703 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,703 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,704 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,707 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,707 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,711 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,711 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,711 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,712 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,712 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,712 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,716 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,716 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,721 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,722 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,722 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,722 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,723 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,723 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,738 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,738 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,739 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,739 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,739 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,739 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,742 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,743 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,743 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,743 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,743 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,743 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,743 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,743 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,744 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,744 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,744 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,744 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,744 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,744 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,744 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,745 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,745 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,745 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,745 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,745 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,746 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,748 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,749 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,749 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,749 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,749 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,749 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,753 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,753 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,753 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,753 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,754 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,754 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,754 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,754 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,754 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,754 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,754 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,755 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,755 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,755 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,755 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,755 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,758 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,758 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,759 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,763 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,763 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,763 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,763 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,763 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,764 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,764 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,764 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,764 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,764 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,764 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,764 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,764 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,766 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,766 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,767 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,767 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,767 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,767 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,769 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,771 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,771 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,771 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,771 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,771 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,771 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,772 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,772 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,772 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,772 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,772 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,772 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,773 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,774 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,775 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,775 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,775 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,776 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,776 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,778 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,779 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,779 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,779 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,779 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,780 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,780 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,780 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,780 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,780 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,781 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,781 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,781 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,781 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,781 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,782 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,782 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,782 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,785 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,793 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,793 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,793 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,795 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,796 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,796 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,796 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,799 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,800 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,800 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,800 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,800 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,801 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,801 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,801 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,801 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,801 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,801 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,803 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,804 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,804 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,804 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,808 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,809 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,809 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,809 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,809 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,809 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,809 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,810 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,810 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,810 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,810 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,812 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,812 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,817 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,818 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,818 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,818 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,818 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,818 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,818 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,818 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,819 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,819 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,819 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,820 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,821 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,821 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,821 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,823 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,823 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,823 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,823 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,824 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,824 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,824 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,824 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,825 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,825 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,825 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,825 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,825 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,826 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,827 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,827 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,828 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,828 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,829 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,829 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,829 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,829 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,830 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,830 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,830 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,830 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,830 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,831 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,831 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,831 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,832 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,842 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,842 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,842 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,842 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,842 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,842 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,842 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,844 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,844 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,845 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,845 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,845 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,845 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,845 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,845 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,845 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,851 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,851 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,851 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,852 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,852 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,852 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,852 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,852 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,852 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,852 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,852 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,853 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,853 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,853 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,854 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,854 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,854 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,854 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,854 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,854 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,854 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,855 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,855 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,855 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,856 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,856 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,856 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,856 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,857 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,857 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,857 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,857 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,858 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,858 WARN L278 uchiComplementFKVNwa]: big16 [2018-11-18 10:17:59,859 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,859 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,860 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,860 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-18 10:17:59,866 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 107 states and 136 transitions. cyclomatic complexity: 36 Second operand 13 states. Result 8714 states and 14786 transitions. Complement of second has 792 states 34 powerset states758 rank states. The highest rank that occured is 9 [2018-11-18 10:17:59,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-11-18 10:17:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 10:17:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 74 transitions. [2018-11-18 10:17:59,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 74 transitions. Stem has 9 letters. Loop has 30 letters. [2018-11-18 10:17:59,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:59,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 74 transitions. Stem has 39 letters. Loop has 30 letters. [2018-11-18 10:17:59,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:59,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 74 transitions. Stem has 9 letters. Loop has 60 letters. [2018-11-18 10:17:59,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:17:59,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8714 states and 14786 transitions. [2018-11-18 10:17:59,924 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 905 [2018-11-18 10:17:59,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8714 states to 5393 states and 9256 transitions. [2018-11-18 10:17:59,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2018-11-18 10:17:59,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2431 [2018-11-18 10:17:59,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5393 states and 9256 transitions. [2018-11-18 10:17:59,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:17:59,954 INFO L705 BuchiCegarLoop]: Abstraction has 5393 states and 9256 transitions. [2018-11-18 10:17:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5393 states and 9256 transitions. [2018-11-18 10:18:00,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5393 to 1258. [2018-11-18 10:18:00,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1258 states. [2018-11-18 10:18:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1926 transitions. [2018-11-18 10:18:00,003 INFO L728 BuchiCegarLoop]: Abstraction has 1258 states and 1926 transitions. [2018-11-18 10:18:00,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 10:18:00,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-11-18 10:18:00,004 INFO L87 Difference]: Start difference. First operand 1258 states and 1926 transitions. Second operand 15 states. [2018-11-18 10:18:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:18:00,168 INFO L93 Difference]: Finished difference Result 1413 states and 1781 transitions. [2018-11-18 10:18:00,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 10:18:00,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1413 states and 1781 transitions. [2018-11-18 10:18:00,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-11-18 10:18:00,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1413 states to 383 states and 480 transitions. [2018-11-18 10:18:00,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-18 10:18:00,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2018-11-18 10:18:00,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 383 states and 480 transitions. [2018-11-18 10:18:00,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:18:00,177 INFO L705 BuchiCegarLoop]: Abstraction has 383 states and 480 transitions. [2018-11-18 10:18:00,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states and 480 transitions. [2018-11-18 10:18:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 276. [2018-11-18 10:18:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-11-18 10:18:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 350 transitions. [2018-11-18 10:18:00,182 INFO L728 BuchiCegarLoop]: Abstraction has 276 states and 350 transitions. [2018-11-18 10:18:00,182 INFO L608 BuchiCegarLoop]: Abstraction has 276 states and 350 transitions. [2018-11-18 10:18:00,182 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 10:18:00,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 350 transitions. [2018-11-18 10:18:00,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-11-18 10:18:00,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:18:00,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:18:00,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1] [2018-11-18 10:18:00,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 6, 5] [2018-11-18 10:18:00,184 INFO L794 eck$LassoCheckResult]: Stem: 18151#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 18152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 18212#L12-2 assume true; 18202#L11-1 assume !!(main_~c~0 > 0); 18203#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 18194#L12-2 assume true; 18195#L11-1 assume !!(main_~c~0 > 0); 18185#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 18171#L12-2 assume true; 18172#L11-1 assume !!(main_~c~0 > 0); 18165#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 18166#L12-2 assume true; 18143#L11-1 [2018-11-18 10:18:00,184 INFO L796 eck$LassoCheckResult]: Loop: 18143#L11-1 assume !!(main_~c~0 > 0); 18144#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 18381#L12-2 assume true; 18380#L11-1 assume !!(main_~c~0 > 0); 18379#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 18378#L12-2 assume true; 18376#L11-1 assume !!(main_~c~0 > 0); 18373#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 18371#L12-2 assume true; 18372#L11-1 assume !!(main_~c~0 > 0); 18367#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 18368#L12-2 assume true; 18363#L11-1 assume !!(main_~c~0 > 0); 18364#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 18359#L12-2 assume true; 18360#L11-1 assume !!(main_~c~0 > 0); 18334#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 18335#L12-2 assume true; 18325#L11-1 assume !!(main_~c~0 > 0); 18326#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 18305#L12-2 assume true; 18306#L11-1 assume !!(main_~c~0 > 0); 18301#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 18302#L12-2 assume true; 18297#L11-1 assume !!(main_~c~0 > 0); 18298#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 18216#L12-2 assume true; 18161#L11-1 assume !!(main_~c~0 > 0); 18174#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 18173#L12-2 assume true; 18169#L11-1 assume !!(main_~c~0 > 0); 18170#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 18160#L12-2 assume true; 18143#L11-1 [2018-11-18 10:18:00,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:00,185 INFO L82 PathProgramCache]: Analyzing trace with hash -33536642, now seen corresponding path program 4 times [2018-11-18 10:18:00,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:18:00,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:18:00,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:00,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:18:00,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:18:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:18:00,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:00,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1171125864, now seen corresponding path program 6 times [2018-11-18 10:18:00,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:18:00,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:18:00,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:00,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:18:00,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:18:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:18:00,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:00,199 INFO L82 PathProgramCache]: Analyzing trace with hash -460249157, now seen corresponding path program 11 times [2018-11-18 10:18:00,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:18:00,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:18:00,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:00,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:18:00,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:18:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:18:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:18:00,352 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2018-11-18 10:18:00,359 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:18:00,359 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:18:00,359 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:18:00,359 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:18:00,359 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:18:00,359 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:18:00,359 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:18:00,359 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:18:00,359 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2018-11-18 10:18:00,359 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:18:00,359 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:18:00,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:18:00,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:18:00,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:18:00,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:18:00,389 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:18:00,389 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:18:00,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:18:00,391 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:18:00,406 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:18:00,406 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:18:00,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:18:00,409 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e598fe-9d9a-4c49-b86c-a11c9f2eb047/bin-2019/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:18:00,426 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:18:00,426 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:18:00,468 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:18:00,469 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:18:00,469 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:18:00,469 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:18:00,469 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:18:00,469 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:18:00,469 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:18:00,469 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:18:00,470 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:18:00,470 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative_true-termination_true-no-overflow.c_Iteration10_Loop [2018-11-18 10:18:00,470 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:18:00,470 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:18:00,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:18:00,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:18:00,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:18:00,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:18:00,503 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:18:00,503 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:18:00,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:18:00,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:18:00,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:18:00,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:18:00,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:18:00,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:18:00,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:18:00,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:18:00,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:18:00,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:18:00,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:18:00,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:18:00,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:18:00,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:18:00,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:18:00,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:18:00,509 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:18:00,510 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:18:00,510 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:18:00,511 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:18:00,511 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:18:00,511 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:18:00,511 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-18 10:18:00,511 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:18:00,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:00,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:18:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:00,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:18:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 86 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 10:18:00,581 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-18 10:18:00,581 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85 Second operand 8 states. [2018-11-18 10:18:00,587 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85. Second operand 8 states. Result 280 states and 354 transitions. Complement of second has 5 states. [2018-11-18 10:18:00,594 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 [2018-11-18 10:18:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 10:18:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-18 10:18:00,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 12 letters. Loop has 33 letters. [2018-11-18 10:18:00,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:18:00,594 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:18:00,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:00,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:18:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:00,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:18:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 86 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 10:18:00,644 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-18 10:18:00,644 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85 Second operand 8 states. [2018-11-18 10:18:00,649 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85. Second operand 8 states. Result 280 states and 354 transitions. Complement of second has 5 states. [2018-11-18 10:18:00,650 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 [2018-11-18 10:18:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 10:18:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-18 10:18:00,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 12 letters. Loop has 33 letters. [2018-11-18 10:18:00,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:18:00,651 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:18:00,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:00,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:18:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:00,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:18:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 86 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 10:18:00,700 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 6 loop predicates [2018-11-18 10:18:00,700 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85 Second operand 8 states. [2018-11-18 10:18:00,729 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85. Second operand 8 states. Result 423 states and 503 transitions. Complement of second has 9 states. [2018-11-18 10:18:00,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:18:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 10:18:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-18 10:18:00,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 33 letters. [2018-11-18 10:18:00,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:18:00,731 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:18:00,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:18:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:00,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:18:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:18:00,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:18:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 86 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 10:18:00,783 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-18 10:18:00,783 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85 Second operand 8 states. [2018-11-18 10:18:00,831 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 276 states and 350 transitions. cyclomatic complexity: 85. Second operand 8 states. Result 640 states and 770 transitions. Complement of second has 27 states. [2018-11-18 10:18:00,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 10:18:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 10:18:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-11-18 10:18:00,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 12 letters. Loop has 33 letters. [2018-11-18 10:18:00,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:18:00,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 45 letters. Loop has 33 letters. [2018-11-18 10:18:00,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:18:00,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 12 letters. Loop has 66 letters. [2018-11-18 10:18:00,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:18:00,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 640 states and 770 transitions. [2018-11-18 10:18:00,837 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:18:00,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 640 states to 0 states and 0 transitions. [2018-11-18 10:18:00,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 10:18:00,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 10:18:00,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 10:18:00,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:18:00,837 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:18:00,837 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:18:00,837 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:18:00,838 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 10:18:00,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:18:00,838 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:18:00,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 10:18:00,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 10:18:00 BoogieIcfgContainer [2018-11-18 10:18:00,845 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 10:18:00,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:18:00,846 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:18:00,846 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:18:00,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:17:55" (3/4) ... [2018-11-18 10:18:00,849 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 10:18:00,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:18:00,850 INFO L168 Benchmark]: Toolchain (without parser) took 5969.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2018-11-18 10:18:00,851 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:18:00,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.69 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:18:00,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.93 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:18:00,852 INFO L168 Benchmark]: Boogie Preprocessor took 10.88 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:18:00,852 INFO L168 Benchmark]: RCFGBuilder took 163.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:18:00,852 INFO L168 Benchmark]: BuchiAutomizer took 5605.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -6.1 MB). Peak memory consumption was 66.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:18:00,853 INFO L168 Benchmark]: Witness Printer took 4.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:18:00,856 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.69 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 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 19.93 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.88 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 163.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5605.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -6.1 MB). Peak memory consumption was 66.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 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 14 terminating modules (5 trivial, 3 deterministic, 6 nondeterministic). One deterministic module has affine ranking function -2 * x + 211 and consists of 4 locations. One deterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One deterministic module has affine ranking function -2 * x + 201 and consists of 4 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 221 and consists of 4 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 14 locations. One nondeterministic module has affine ranking function c and consists of 7 locations. 5 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 11 iterations. TraceHistogramMax:11. Analysis of lassos took 2.7s. Construction of modules took 0.3s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 9. Minimization of det autom 1. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 4813 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 276 states and ocurred in iteration 9. Nontrivial modules had stage [2, 1, 3, 1, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 213/315 HoareTripleCheckerStatistics: 224 SDtfs, 236 SDslu, 203 SDs, 0 SdLazy, 364 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT5 conc0 concLT3 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax161 hnf98 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...