./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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 31d0c4253184c01eb9f9573658b07bed7aa94585 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:30:40,336 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:30:40,338 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:30:40,346 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:30:40,346 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:30:40,347 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:30:40,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:30:40,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:30:40,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:30:40,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:30:40,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:30:40,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:30:40,351 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:30:40,352 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:30:40,353 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:30:40,353 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:30:40,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:30:40,355 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:30:40,356 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:30:40,357 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:30:40,358 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:30:40,358 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:30:40,360 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:30:40,360 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:30:40,360 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:30:40,360 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:30:40,361 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:30:40,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:30:40,362 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:30:40,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:30:40,363 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:30:40,363 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:30:40,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:30:40,364 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:30:40,364 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:30:40,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:30:40,365 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 05:30:40,375 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:30:40,375 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:30:40,376 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:30:40,376 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:30:40,376 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:30:40,376 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:30:40,376 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:30:40,376 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:30:40,377 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:30:40,377 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:30:40,377 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:30:40,377 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:30:40,377 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:30:40,377 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:30:40,377 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:30:40,377 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:30:40,377 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:30:40,378 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:30:40,378 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:30:40,378 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:30:40,378 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:30:40,378 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:30:40,378 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:30:40,378 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:30:40,378 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:30:40,379 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:30:40,379 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:30:40,379 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:30:40,380 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_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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 -> 31d0c4253184c01eb9f9573658b07bed7aa94585 [2018-11-10 05:30:40,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:30:40,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:30:40,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:30:40,419 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:30:40,419 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:30:40,420 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2_true-termination_true-no-overflow.c [2018-11-10 05:30:40,458 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/data/485ba33a2/27a2219564a342ceb3a62af098c0d1f3/FLAG989c7851b [2018-11-10 05:30:40,754 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:30:40,754 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2_true-termination_true-no-overflow.c [2018-11-10 05:30:40,759 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/data/485ba33a2/27a2219564a342ceb3a62af098c0d1f3/FLAG989c7851b [2018-11-10 05:30:40,767 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/data/485ba33a2/27a2219564a342ceb3a62af098c0d1f3 [2018-11-10 05:30:40,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:30:40,771 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:30:40,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:30:40,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:30:40,775 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:30:40,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:30:40" (1/1) ... [2018-11-10 05:30:40,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12305cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:40, skipping insertion in model container [2018-11-10 05:30:40,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:30:40" (1/1) ... [2018-11-10 05:30:40,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:30:40,798 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:30:40,911 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:30:40,913 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:30:40,923 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:30:40,931 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:30:40,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:40 WrapperNode [2018-11-10 05:30:40,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:30:40,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:30:40,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:30:40,932 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:30:40,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:40" (1/1) ... [2018-11-10 05:30:40,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:40" (1/1) ... [2018-11-10 05:30:40,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:30:40,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:30:40,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:30:40,948 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:30:40,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:40" (1/1) ... [2018-11-10 05:30:40,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:40" (1/1) ... [2018-11-10 05:30:40,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:40" (1/1) ... [2018-11-10 05:30:40,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:40" (1/1) ... [2018-11-10 05:30:40,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:40" (1/1) ... [2018-11-10 05:30:40,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:40" (1/1) ... [2018-11-10 05:30:40,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:40" (1/1) ... [2018-11-10 05:30:40,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:30:40,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:30:40,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:30:40,958 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:30:40,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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-10 05:30:41,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:30:41,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:30:41,114 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:30:41,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:30:41 BoogieIcfgContainer [2018-11-10 05:30:41,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:30:41,115 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:30:41,115 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:30:41,117 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:30:41,118 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:30:41,118 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:30:40" (1/3) ... [2018-11-10 05:30:41,118 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3325838a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:30:41, skipping insertion in model container [2018-11-10 05:30:41,119 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:30:41,119 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:30:40" (2/3) ... [2018-11-10 05:30:41,119 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3325838a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:30:41, skipping insertion in model container [2018-11-10 05:30:41,119 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:30:41,119 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:30:41" (3/3) ... [2018-11-10 05:30:41,120 INFO L375 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2_true-termination_true-no-overflow.c [2018-11-10 05:30:41,161 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:30:41,162 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:30:41,162 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:30:41,162 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:30:41,162 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:30:41,162 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:30:41,162 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:30:41,162 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:30:41,163 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:30:41,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-10 05:30:41,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:30:41,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:30:41,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:30:41,195 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:30:41,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:30:41,195 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:30:41,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-10 05:30:41,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:30:41,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:30:41,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:30:41,196 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:30:41,196 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:30:41,202 INFO L793 eck$LassoCheckResult]: Stem: 6#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_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 7#L19-3true [2018-11-10 05:30:41,203 INFO L795 eck$LassoCheckResult]: Loop: 7#L19-3true assume true; 10#L19-1true assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 11#L21-3true assume !true; 8#L21-4true main_~x1~0 := main_~x1~0 + 1; 7#L19-3true [2018-11-10 05:30:41,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,206 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 05:30:41,207 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1114569, now seen corresponding path program 1 times [2018-11-10 05:30:41,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:41,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:41,286 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-10 05:30:41,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:41,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:30:41,290 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:30:41,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 05:30:41,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 05:30:41,301 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 2 states. [2018-11-10 05:30:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:41,304 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-11-10 05:30:41,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 05:30:41,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-11-10 05:30:41,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:30:41,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2018-11-10 05:30:41,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-10 05:30:41,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-10 05:30:41,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-10 05:30:41,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:30:41,311 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-10 05:30:41,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-10 05:30:41,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-10 05:30:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 05:30:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-10 05:30:41,330 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-10 05:30:41,330 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-10 05:30:41,330 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:30:41,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-10 05:30:41,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:30:41,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:30:41,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:30:41,331 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:30:41,332 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 05:30:41,332 INFO L793 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 30#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 31#L19-3 [2018-11-10 05:30:41,332 INFO L795 eck$LassoCheckResult]: Loop: 31#L19-3 assume true; 33#L19-1 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 35#L21-3 assume true; 36#L21-1 assume !(main_~x2~0 > 1); 34#L21-4 main_~x1~0 := main_~x1~0 + 1; 31#L19-3 [2018-11-10 05:30:41,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,332 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 05:30:41,333 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:41,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,337 INFO L82 PathProgramCache]: Analyzing trace with hash 34543791, now seen corresponding path program 1 times [2018-11-10 05:30:41,337 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:41,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:41,355 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-10 05:30:41,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:41,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:30:41,356 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:30:41,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:30:41,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:30:41,356 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 3 states. [2018-11-10 05:30:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:41,367 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-11-10 05:30:41,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:30:41,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-11-10 05:30:41,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:30:41,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2018-11-10 05:30:41,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-10 05:30:41,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-10 05:30:41,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-11-10 05:30:41,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:30:41,369 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-10 05:30:41,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-11-10 05:30:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-10 05:30:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 05:30:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-10 05:30:41,370 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-10 05:30:41,370 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-10 05:30:41,370 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:30:41,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-10 05:30:41,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 05:30:41,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:30:41,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:30:41,371 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:30:41,371 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-10 05:30:41,372 INFO L793 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 52#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 53#L19-3 [2018-11-10 05:30:41,372 INFO L795 eck$LassoCheckResult]: Loop: 53#L19-3 assume true; 55#L19-1 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 57#L21-3 assume true; 58#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 59#L21-3 assume true; 60#L21-1 assume !(main_~x2~0 > 1); 56#L21-4 main_~x1~0 := main_~x1~0 + 1; 53#L19-3 [2018-11-10 05:30:41,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,372 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 05:30:41,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:41,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1163104599, now seen corresponding path program 1 times [2018-11-10 05:30:41,376 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:41,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:41,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:30:41,407 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:30:41,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:41,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:41,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:30:41,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 05:30:41,449 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:30:41,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:30:41,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:30:41,449 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-10 05:30:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:41,463 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-11-10 05:30:41,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:30:41,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-11-10 05:30:41,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 05:30:41,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2018-11-10 05:30:41,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 05:30:41,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 05:30:41,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2018-11-10 05:30:41,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:30:41,465 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-10 05:30:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2018-11-10 05:30:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-10 05:30:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 05:30:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-11-10 05:30:41,466 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-10 05:30:41,466 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-10 05:30:41,466 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:30:41,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-11-10 05:30:41,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 05:30:41,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:30:41,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:30:41,467 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:30:41,467 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2018-11-10 05:30:41,468 INFO L793 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 97#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 98#L19-3 [2018-11-10 05:30:41,468 INFO L795 eck$LassoCheckResult]: Loop: 98#L19-3 assume true; 100#L19-1 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 102#L21-3 assume true; 103#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 104#L21-3 assume true; 107#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 106#L21-3 assume true; 105#L21-1 assume !(main_~x2~0 > 1); 101#L21-4 main_~x1~0 := main_~x1~0 + 1; 98#L19-3 [2018-11-10 05:30:41,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,468 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 05:30:41,468 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:41,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1051972061, now seen corresponding path program 2 times [2018-11-10 05:30:41,473 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:41,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:41,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:41,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:30:41,504 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:30:41,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 05:30:41,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 05:30:41,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:30:41,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:41,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:30:41,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 05:30:41,537 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:30:41,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:30:41,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:30:41,537 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-10 05:30:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:41,549 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-10 05:30:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:30:41,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2018-11-10 05:30:41,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 05:30:41,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2018-11-10 05:30:41,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 05:30:41,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 05:30:41,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-11-10 05:30:41,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:30:41,551 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-10 05:30:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-11-10 05:30:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-10 05:30:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 05:30:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-10 05:30:41,552 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-10 05:30:41,552 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-10 05:30:41,552 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:30:41,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2018-11-10 05:30:41,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 05:30:41,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:30:41,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:30:41,553 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:30:41,553 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1] [2018-11-10 05:30:41,553 INFO L793 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 154#L19-3 [2018-11-10 05:30:41,553 INFO L795 eck$LassoCheckResult]: Loop: 154#L19-3 assume true; 156#L19-1 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 158#L21-3 assume true; 161#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 159#L21-3 assume true; 160#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 165#L21-3 assume true; 164#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 163#L21-3 assume true; 162#L21-1 assume !(main_~x2~0 > 1); 157#L21-4 main_~x1~0 := main_~x1~0 + 1; 154#L19-3 [2018-11-10 05:30:41,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,553 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 05:30:41,553 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:41,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1627785443, now seen corresponding path program 3 times [2018-11-10 05:30:41,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:41,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:41,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:30:41,599 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:30:41,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:30:41,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 05:30:41,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:30:41,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:41,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:30:41,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 05:30:41,633 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:30:41,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:30:41,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:30:41,634 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-10 05:30:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:41,655 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-10 05:30:41,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:30:41,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2018-11-10 05:30:41,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 05:30:41,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2018-11-10 05:30:41,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 05:30:41,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 05:30:41,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2018-11-10 05:30:41,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:30:41,657 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-10 05:30:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2018-11-10 05:30:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-10 05:30:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 05:30:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-10 05:30:41,659 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-10 05:30:41,659 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-10 05:30:41,659 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 05:30:41,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-10 05:30:41,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 05:30:41,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:30:41,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:30:41,661 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:30:41,661 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2018-11-10 05:30:41,661 INFO L793 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 221#L19-3 [2018-11-10 05:30:41,661 INFO L795 eck$LassoCheckResult]: Loop: 221#L19-3 assume true; 223#L19-1 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 225#L21-3 assume true; 228#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 226#L21-3 assume true; 227#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 234#L21-3 assume true; 233#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 232#L21-3 assume true; 231#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 230#L21-3 assume true; 229#L21-1 assume !(main_~x2~0 > 1); 224#L21-4 main_~x1~0 := main_~x1~0 + 1; 221#L19-3 [2018-11-10 05:30:41,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,661 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 05:30:41,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:41,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,665 INFO L82 PathProgramCache]: Analyzing trace with hash -933664361, now seen corresponding path program 4 times [2018-11-10 05:30:41,665 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:41,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:41,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:30:41,737 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:30:41,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 05:30:41,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 05:30:41,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:30:41,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:41,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:30:41,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 05:30:41,775 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:30:41,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:30:41,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:30:41,776 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand 7 states. [2018-11-10 05:30:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:41,787 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-10 05:30:41,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:30:41,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2018-11-10 05:30:41,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 05:30:41,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2018-11-10 05:30:41,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 05:30:41,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 05:30:41,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2018-11-10 05:30:41,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:30:41,788 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 05:30:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2018-11-10 05:30:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 05:30:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 05:30:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-10 05:30:41,790 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 05:30:41,790 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 05:30:41,790 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 05:30:41,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-11-10 05:30:41,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 05:30:41,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:30:41,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:30:41,790 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:30:41,790 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 1, 1, 1, 1] [2018-11-10 05:30:41,790 INFO L793 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 298#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 299#L19-3 [2018-11-10 05:30:41,791 INFO L795 eck$LassoCheckResult]: Loop: 299#L19-3 assume true; 301#L19-1 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 305#L21-3 assume true; 306#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 303#L21-3 assume true; 304#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 314#L21-3 assume true; 313#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 312#L21-3 assume true; 311#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 310#L21-3 assume true; 309#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 308#L21-3 assume true; 307#L21-1 assume !(main_~x2~0 > 1); 302#L21-4 main_~x1~0 := main_~x1~0 + 1; 299#L19-3 [2018-11-10 05:30:41,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,791 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 05:30:41,791 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:41,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,793 INFO L82 PathProgramCache]: Analyzing trace with hash 396764561, now seen corresponding path program 5 times [2018-11-10 05:30:41,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:41,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:41,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:30:41,842 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:30:41,847 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 05:30:41,856 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 05:30:41,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:30:41,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:41,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:30:41,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 05:30:41,881 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:30:41,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:30:41,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:30:41,882 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand 8 states. [2018-11-10 05:30:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:41,906 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-10 05:30:41,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:30:41,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2018-11-10 05:30:41,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 05:30:41,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2018-11-10 05:30:41,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 05:30:41,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 05:30:41,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2018-11-10 05:30:41,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:30:41,908 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 05:30:41,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2018-11-10 05:30:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 05:30:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 05:30:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-10 05:30:41,909 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 05:30:41,909 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 05:30:41,909 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 05:30:41,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2018-11-10 05:30:41,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 05:30:41,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:30:41,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:30:41,909 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:30:41,909 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2018-11-10 05:30:41,910 INFO L793 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 387#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 388#L19-3 [2018-11-10 05:30:41,910 INFO L795 eck$LassoCheckResult]: Loop: 388#L19-3 assume true; 390#L19-1 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 394#L21-3 assume true; 395#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 392#L21-3 assume true; 393#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 405#L21-3 assume true; 404#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 403#L21-3 assume true; 402#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 401#L21-3 assume true; 400#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 399#L21-3 assume true; 398#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 397#L21-3 assume true; 396#L21-1 assume !(main_~x2~0 > 1); 391#L21-4 main_~x1~0 := main_~x1~0 + 1; 388#L19-3 [2018-11-10 05:30:41,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-10 05:30:41,910 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:41,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:41,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:41,913 INFO L82 PathProgramCache]: Analyzing trace with hash -961295605, now seen corresponding path program 6 times [2018-11-10 05:30:41,913 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:41,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:41,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:41,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:41,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:30:41,970 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:30:41,975 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 05:30:41,985 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-10 05:30:41,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:30:41,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:42,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:30:42,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-10 05:30:42,005 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:30:42,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:30:42,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:30:42,005 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand 9 states. [2018-11-10 05:30:42,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:42,015 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-10 05:30:42,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:30:42,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-11-10 05:30:42,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 05:30:42,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2018-11-10 05:30:42,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 05:30:42,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 05:30:42,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2018-11-10 05:30:42,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:30:42,017 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-10 05:30:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2018-11-10 05:30:42,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 05:30:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 05:30:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-10 05:30:42,018 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-10 05:30:42,018 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-10 05:30:42,018 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 05:30:42,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2018-11-10 05:30:42,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 05:30:42,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:30:42,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:30:42,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:30:42,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 1, 1, 1, 1] [2018-11-10 05:30:42,019 INFO L793 eck$LassoCheckResult]: Stem: 489#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 487#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 488#L19-3 [2018-11-10 05:30:42,020 INFO L795 eck$LassoCheckResult]: Loop: 488#L19-3 assume true; 490#L19-1 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 494#L21-3 assume true; 495#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 492#L21-3 assume true; 493#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 507#L21-3 assume true; 506#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 505#L21-3 assume true; 504#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 503#L21-3 assume true; 502#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 501#L21-3 assume true; 500#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 499#L21-3 assume true; 498#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 497#L21-3 assume true; 496#L21-1 assume !(main_~x2~0 > 1); 491#L21-4 main_~x1~0 := main_~x1~0 + 1; 488#L19-3 [2018-11-10 05:30:42,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:42,020 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-11-10 05:30:42,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:42,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:42,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:42,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:42,023 INFO L82 PathProgramCache]: Analyzing trace with hash -387057147, now seen corresponding path program 7 times [2018-11-10 05:30:42,023 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:42,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:42,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:42,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:42,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:30:42,099 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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-10 05:30:42,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:42,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:42,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:30:42,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 05:30:42,134 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:30:42,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 05:30:42,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:30:42,134 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 2 Second operand 10 states. [2018-11-10 05:30:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:42,157 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-10 05:30:42,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 05:30:42,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2018-11-10 05:30:42,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 05:30:42,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2018-11-10 05:30:42,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 05:30:42,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 05:30:42,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2018-11-10 05:30:42,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:30:42,160 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 05:30:42,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2018-11-10 05:30:42,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 05:30:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 05:30:42,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-10 05:30:42,162 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 05:30:42,162 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 05:30:42,162 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 05:30:42,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2018-11-10 05:30:42,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 05:30:42,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:30:42,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:30:42,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:30:42,163 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 1, 1, 1, 1] [2018-11-10 05:30:42,163 INFO L793 eck$LassoCheckResult]: Stem: 601#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 598#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 599#L19-3 [2018-11-10 05:30:42,163 INFO L795 eck$LassoCheckResult]: Loop: 599#L19-3 assume true; 600#L19-1 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 603#L21-3 assume true; 606#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 604#L21-3 assume true; 605#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 620#L21-3 assume true; 619#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 618#L21-3 assume true; 617#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 616#L21-3 assume true; 615#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 614#L21-3 assume true; 613#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 612#L21-3 assume true; 611#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 610#L21-3 assume true; 609#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 608#L21-3 assume true; 607#L21-1 assume !(main_~x2~0 > 1); 602#L21-4 main_~x1~0 := main_~x1~0 + 1; 599#L19-3 [2018-11-10 05:30:42,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:42,164 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-11-10 05:30:42,164 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:42,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:42,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:42,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:42,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1700287103, now seen corresponding path program 8 times [2018-11-10 05:30:42,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:42,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:42,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:42,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:42,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:30:42,267 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:30:42,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 05:30:42,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 05:30:42,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:30:42,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:30:42,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:30:42,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-10 05:30:42,304 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:30:42,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:30:42,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:30:42,305 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 2 Second operand 11 states. [2018-11-10 05:30:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:42,325 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-10 05:30:42,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:30:42,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2018-11-10 05:30:42,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 05:30:42,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2018-11-10 05:30:42,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 05:30:42,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-10 05:30:42,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2018-11-10 05:30:42,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:30:42,327 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 05:30:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2018-11-10 05:30:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 05:30:42,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 05:30:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-10 05:30:42,328 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 05:30:42,328 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 05:30:42,328 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 05:30:42,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2018-11-10 05:30:42,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 05:30:42,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:30:42,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:30:42,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:30:42,329 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2018-11-10 05:30:42,329 INFO L793 eck$LassoCheckResult]: Stem: 722#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 720#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 721#L19-3 [2018-11-10 05:30:42,329 INFO L795 eck$LassoCheckResult]: Loop: 721#L19-3 assume true; 723#L19-1 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 727#L21-3 assume true; 728#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 725#L21-3 assume true; 726#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 744#L21-3 assume true; 743#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 742#L21-3 assume true; 741#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 740#L21-3 assume true; 739#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 738#L21-3 assume true; 737#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 736#L21-3 assume true; 735#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 734#L21-3 assume true; 733#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 732#L21-3 assume true; 731#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 730#L21-3 assume true; 729#L21-1 assume !(main_~x2~0 > 1); 724#L21-4 main_~x1~0 := main_~x1~0 + 1; 721#L19-3 [2018-11-10 05:30:42,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:42,329 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2018-11-10 05:30:42,330 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:42,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:42,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:42,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:42,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1888384121, now seen corresponding path program 9 times [2018-11-10 05:30:42,333 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:42,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:42,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:42,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:42,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1852397175, now seen corresponding path program 1 times [2018-11-10 05:30:42,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:42,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,427 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:30:42,428 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:30:42,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:30:42,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:30:42,428 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:30:42,428 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:30:42,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:30:42,428 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:30:42,428 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2_true-termination_true-no-overflow.c_Iteration11_Loop [2018-11-10 05:30:42,429 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:30:42,429 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:30:42,440 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-10 05:30:42,444 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-10 05:30:42,446 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-10 05:30:42,459 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-10 05:30:42,491 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:30:42,492 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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-10 05:30:42,494 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:30:42,495 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:30:42,514 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:30:42,514 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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-10 05:30:42,516 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:30:42,516 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:30:42,534 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:30:42,534 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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-10 05:30:42,537 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:30:42,537 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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-10 05:30:42,554 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:30:42,554 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:30:42,574 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:30:42,575 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:30:42,575 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:30:42,575 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:30:42,575 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:30:42,575 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:30:42,575 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:30:42,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:30:42,575 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:30:42,576 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2_true-termination_true-no-overflow.c_Iteration11_Loop [2018-11-10 05:30:42,576 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:30:42,576 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:30:42,577 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-10 05:30:42,587 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-10 05:30:42,603 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-10 05:30:42,606 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-10 05:30:42,654 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:30:42,657 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:30:42,658 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-10 05:30:42,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:30:42,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:30:42,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:30:42,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:30:42,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:30:42,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:30:42,666 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:30:42,667 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-10 05:30:42,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:30:42,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:30:42,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:30:42,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:30:42,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:30:42,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:30:42,672 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:30:42,673 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-10 05:30:42,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:30:42,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:30:42,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:30:42,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:30:42,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:30:42,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:30:42,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:30:42,677 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:30:42,682 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:30:42,683 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 05:30:42,684 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:30:42,684 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:30:42,684 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:30:42,685 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x1~0) = -2*ULTIMATE.start_main_~x1~0 + 21 Supporting invariants [] [2018-11-10 05:30:42,686 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:30:42,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:42,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:42,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-10 05:30:42,752 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-10 05:30:42,753 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-10 05:30:42,773 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 48 states and 51 transitions. Complement of second has 6 states. [2018-11-10 05:30:42,774 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-10 05:30:42,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:30:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-10 05:30:42,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 23 letters. [2018-11-10 05:30:42,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:30:42,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 25 letters. Loop has 23 letters. [2018-11-10 05:30:42,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:30:42,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 46 letters. [2018-11-10 05:30:42,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:30:42,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 51 transitions. [2018-11-10 05:30:42,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 05:30:42,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 50 transitions. [2018-11-10 05:30:42,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 05:30:42,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-10 05:30:42,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 50 transitions. [2018-11-10 05:30:42,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:30:42,779 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-11-10 05:30:42,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 50 transitions. [2018-11-10 05:30:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2018-11-10 05:30:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 05:30:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-10 05:30:42,781 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-10 05:30:42,781 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-10 05:30:42,781 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 05:30:42,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions. [2018-11-10 05:30:42,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 05:30:42,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:30:42,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:30:42,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:30:42,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-10 05:30:42,782 INFO L793 eck$LassoCheckResult]: Stem: 893#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 891#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 892#L19-3 assume true; 895#L19-1 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 898#L21-3 [2018-11-10 05:30:42,782 INFO L795 eck$LassoCheckResult]: Loop: 898#L21-3 assume true; 900#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 898#L21-3 [2018-11-10 05:30:42,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:42,783 INFO L82 PathProgramCache]: Analyzing trace with hash 925641, now seen corresponding path program 1 times [2018-11-10 05:30:42,783 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:42,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:42,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:42,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:42,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1479, now seen corresponding path program 1 times [2018-11-10 05:30:42,786 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:42,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:42,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:42,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:42,789 INFO L82 PathProgramCache]: Analyzing trace with hash 889541519, now seen corresponding path program 1 times [2018-11-10 05:30:42,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:42,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:42,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:42,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:42,801 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:30:42,801 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:30:42,801 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:30:42,801 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:30:42,801 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:30:42,801 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:30:42,801 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:30:42,801 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:30:42,801 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2_true-termination_true-no-overflow.c_Iteration12_Loop [2018-11-10 05:30:42,801 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:30:42,802 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:30:42,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:30:42,804 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-10 05:30:42,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:30:42,832 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:30:42,832 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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-10 05:30:42,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:30:42,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:30:42,850 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:30:42,850 INFO L446 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_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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-10 05:30:42,852 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:30:42,852 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:30:42,868 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:30:42,868 INFO L446 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_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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-10 05:30:42,871 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:30:42,871 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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-10 05:30:42,889 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:30:42,889 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:30:42,916 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:30:42,917 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:30:42,917 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:30:42,917 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:30:42,917 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:30:42,917 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:30:42,917 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:30:42,917 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:30:42,917 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:30:42,917 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2_true-termination_true-no-overflow.c_Iteration12_Loop [2018-11-10 05:30:42,917 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:30:42,917 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:30:42,918 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-10 05:30:42,919 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-10 05:30:42,921 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-10 05:30:42,940 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:30:42,940 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:30:42,940 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-10 05:30:42,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:30:42,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:30:42,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:30:42,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:30:42,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:30:42,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:30:42,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:30:42,944 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-10 05:30:42,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:30:42,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:30:42,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:30:42,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:30:42,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:30:42,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:30:42,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:30:42,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:30:42,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:30:42,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:30:42,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:30:42,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:30:42,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:30:42,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:30:42,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:30:42,953 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:30:42,954 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:30:42,954 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:30:42,954 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:30:42,954 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:30:42,955 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:30:42,955 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] [2018-11-10 05:30:42,955 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:30:42,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:42,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:42,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:42,977 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-10 05:30:42,977 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-10 05:30:42,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-10 05:30:42,983 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 73 states and 79 transitions. Complement of second has 5 states. [2018-11-10 05:30:42,984 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-10 05:30:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 05:30:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 05:30:42,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-10 05:30:42,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:30:42,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-10 05:30:42,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:30:42,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-10 05:30:42,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:30:42,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 79 transitions. [2018-11-10 05:30:42,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 05:30:42,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 55 states and 59 transitions. [2018-11-10 05:30:42,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-10 05:30:42,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-10 05:30:42,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2018-11-10 05:30:42,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:30:42,987 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-10 05:30:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2018-11-10 05:30:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-11-10 05:30:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 05:30:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-10 05:30:42,990 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-10 05:30:42,990 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-10 05:30:42,990 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 05:30:42,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 53 transitions. [2018-11-10 05:30:42,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 05:30:42,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:30:42,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:30:42,992 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 2, 2, 1, 1, 1, 1] [2018-11-10 05:30:42,992 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-10 05:30:42,992 INFO L793 eck$LassoCheckResult]: Stem: 1037#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1031#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 1032#L19-3 assume true; 1033#L19-1 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 1080#L21-3 assume true; 1079#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 1078#L21-3 assume true; 1076#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 1074#L21-3 assume true; 1072#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 1070#L21-3 assume true; 1068#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 1066#L21-3 assume true; 1064#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 1062#L21-3 assume true; 1060#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 1058#L21-3 assume true; 1056#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 1054#L21-3 assume true; 1052#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 1050#L21-3 assume true; 1049#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 1048#L21-3 assume true; 1044#L21-1 assume !(main_~x2~0 > 1); 1038#L21-4 main_~x1~0 := main_~x1~0 + 1; 1034#L19-3 assume true; 1036#L19-1 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 1039#L21-3 [2018-11-10 05:30:42,992 INFO L795 eck$LassoCheckResult]: Loop: 1039#L21-3 assume true; 1040#L21-1 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 1039#L21-3 [2018-11-10 05:30:42,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:42,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2037224829, now seen corresponding path program 2 times [2018-11-10 05:30:42,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:42,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:42,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:42,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:43,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:43,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1479, now seen corresponding path program 2 times [2018-11-10 05:30:43,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:43,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:43,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:43,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:43,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:43,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:43,006 INFO L82 PathProgramCache]: Analyzing trace with hash -732025789, now seen corresponding path program 3 times [2018-11-10 05:30:43,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:30:43,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:30:43,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:43,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:30:43,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:30:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:30:43,028 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:30:43,028 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:30:43,028 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:30:43,028 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:30:43,028 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:30:43,028 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:30:43,028 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:30:43,028 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:30:43,029 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2_true-termination_true-no-overflow.c_Iteration13_Loop [2018-11-10 05:30:43,029 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:30:43,029 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:30:43,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-10 05:30:43,046 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-10 05:30:43,048 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-10 05:30:43,069 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:30:43,069 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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-10 05:30:43,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:30:43,075 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:30:43,091 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:30:43,091 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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-10 05:30:43,094 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:30:43,094 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:30:43,110 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:30:43,110 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/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-10 05:30:43,113 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:30:43,113 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e62fe551-c2d2-4cf9-9c4a-c3d8dd9b9753/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:30:43,131 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:30:43,132 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:30:43,149 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:30:43,150 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:30:43,150 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:30:43,150 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:30:43,150 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:30:43,150 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:30:43,150 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:30:43,151 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:30:43,151 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:30:43,151 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2_true-termination_true-no-overflow.c_Iteration13_Loop [2018-11-10 05:30:43,151 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:30:43,151 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:30:43,151 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-10 05:30:43,163 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-10 05:30:43,167 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-10 05:30:43,188 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:30:43,188 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:30:43,189 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-10 05:30:43,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:30:43,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:30:43,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:30:43,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:30:43,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:30:43,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:30:43,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:30:43,195 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-10 05:30:43,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:30:43,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:30:43,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:30:43,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:30:43,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:30:43,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:30:43,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:30:43,199 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-10 05:30:43,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:30:43,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:30:43,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:30:43,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:30:43,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:30:43,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:30:43,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:30:43,202 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:30:43,203 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:30:43,203 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:30:43,204 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:30:43,204 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:30:43,204 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:30:43,204 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] [2018-11-10 05:30:43,204 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:30:43,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:43,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:43,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:43,239 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-10 05:30:43,239 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-10 05:30:43,239 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-10 05:30:43,246 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 68 states and 73 transitions. Complement of second has 5 states. [2018-11-10 05:30:43,246 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-10 05:30:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 05:30:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 05:30:43,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2018-11-10 05:30:43,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:30:43,247 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:30:43,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:43,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:43,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:43,267 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-10 05:30:43,267 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-10 05:30:43,267 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-10 05:30:43,272 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 68 states and 73 transitions. Complement of second has 5 states. [2018-11-10 05:30:43,274 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-10 05:30:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 05:30:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 05:30:43,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2018-11-10 05:30:43,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:30:43,274 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:30:43,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:43,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:43,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:43,290 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-10 05:30:43,291 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-10 05:30:43,291 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-10 05:30:43,297 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 76 states and 82 transitions. Complement of second has 4 states. [2018-11-10 05:30:43,298 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-10 05:30:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 05:30:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-10 05:30:43,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 27 letters. Loop has 2 letters. [2018-11-10 05:30:43,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:30:43,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 29 letters. Loop has 2 letters. [2018-11-10 05:30:43,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:30:43,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 27 letters. Loop has 4 letters. [2018-11-10 05:30:43,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:30:43,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 82 transitions. [2018-11-10 05:30:43,301 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:30:43,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions. [2018-11-10 05:30:43,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:30:43,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:30:43,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:30:43,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:30:43,302 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:30:43,302 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:30:43,302 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:30:43,302 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 05:30:43,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:30:43,302 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:30:43,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:30:43,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:30:43 BoogieIcfgContainer [2018-11-10 05:30:43,307 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:30:43,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:30:43,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:30:43,308 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:30:43,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:30:41" (3/4) ... [2018-11-10 05:30:43,310 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:30:43,310 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:30:43,311 INFO L168 Benchmark]: Toolchain (without parser) took 2540.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 954.8 MB in the beginning and 1.2 GB in the end (delta: -211.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:30:43,312 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:30:43,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.88 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 942.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:30:43,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.20 ms. Allocated memory is still 1.0 GB. Free memory is still 942.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:30:43,313 INFO L168 Benchmark]: Boogie Preprocessor took 9.62 ms. Allocated memory is still 1.0 GB. Free memory was 942.9 MB in the beginning and 940.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:30:43,313 INFO L168 Benchmark]: RCFGBuilder took 157.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:30:43,313 INFO L168 Benchmark]: BuchiAutomizer took 2192.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -43.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:30:43,314 INFO L168 Benchmark]: Witness Printer took 3.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:30:43,316 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 159.88 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 942.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.20 ms. Allocated memory is still 1.0 GB. Free memory is still 942.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.62 ms. Allocated memory is still 1.0 GB. Free memory was 942.9 MB in the beginning and 940.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 157.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2192.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -43.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (10 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * x1 + 21 and consists of 4 locations. One deterministic module has affine ranking function x2 and consists of 3 locations. One nondeterministic module has affine ranking function x2 and consists of 3 locations. 10 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 14 iterations. TraceHistogramMax:10. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 50 states and ocurred in iteration 12. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 90/90 HoareTripleCheckerStatistics: 117 SDtfs, 38 SDslu, 179 SDs, 0 SdLazy, 155 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI10 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax210 hnf100 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...