./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/NO_22_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/NO_22_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/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 4e32f3b75457895ed6b80ddc53a00ac44a497e1b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:15:46,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:15:46,606 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:15:46,613 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:15:46,613 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:15:46,613 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:15:46,614 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:15:46,615 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:15:46,616 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:15:46,617 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:15:46,617 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:15:46,618 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:15:46,618 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:15:46,619 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:15:46,620 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:15:46,620 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:15:46,621 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:15:46,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:15:46,623 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:15:46,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:15:46,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:15:46,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:15:46,627 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:15:46,627 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:15:46,628 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:15:46,628 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:15:46,629 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:15:46,629 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:15:46,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:15:46,631 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:15:46,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:15:46,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:15:46,632 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:15:46,632 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:15:46,632 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:15:46,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:15:46,633 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 13:15:46,643 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:15:46,644 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:15:46,644 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:15:46,644 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:15:46,645 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:15:46,645 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:15:46,645 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:15:46,645 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:15:46,645 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:15:46,645 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:15:46,645 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:15:46,646 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:15:46,646 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:15:46,646 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:15:46,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:15:46,646 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:15:46,646 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:15:46,646 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:15:46,646 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:15:46,646 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:15:46,647 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:15:46,647 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:15:46,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:15:46,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:15:46,647 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:15:46,647 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:15:46,647 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:15:46,647 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:15:46,648 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:15:46,648 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_9282e44b-c7f4-4103-b674-f5685fcf98ad/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 -> 4e32f3b75457895ed6b80ddc53a00ac44a497e1b [2018-11-23 13:15:46,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:15:46,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:15:46,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:15:46,679 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:15:46,679 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:15:46,680 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/NO_22_false-termination_true-no-overflow.c [2018-11-23 13:15:46,715 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/data/a37b0d674/12fb0b95f9ee46428b746f17744ce83c/FLAG842bc6c01 [2018-11-23 13:15:47,014 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:15:47,015 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/sv-benchmarks/c/termination-restricted-15/NO_22_false-termination_true-no-overflow.c [2018-11-23 13:15:47,019 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/data/a37b0d674/12fb0b95f9ee46428b746f17744ce83c/FLAG842bc6c01 [2018-11-23 13:15:47,029 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/data/a37b0d674/12fb0b95f9ee46428b746f17744ce83c [2018-11-23 13:15:47,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:15:47,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:15:47,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:15:47,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:15:47,035 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:15:47,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:47" (1/1) ... [2018-11-23 13:15:47,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ef1641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:47, skipping insertion in model container [2018-11-23 13:15:47,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:47" (1/1) ... [2018-11-23 13:15:47,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:15:47,054 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:15:47,158 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:15:47,161 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:15:47,170 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:15:47,178 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:15:47,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:47 WrapperNode [2018-11-23 13:15:47,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:15:47,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:15:47,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:15:47,180 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:15:47,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:47" (1/1) ... [2018-11-23 13:15:47,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:47" (1/1) ... [2018-11-23 13:15:47,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:15:47,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:15:47,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:15:47,198 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:15:47,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:47" (1/1) ... [2018-11-23 13:15:47,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:47" (1/1) ... [2018-11-23 13:15:47,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:47" (1/1) ... [2018-11-23 13:15:47,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:47" (1/1) ... [2018-11-23 13:15:47,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:47" (1/1) ... [2018-11-23 13:15:47,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:47" (1/1) ... [2018-11-23 13:15:47,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:47" (1/1) ... [2018-11-23 13:15:47,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:15:47,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:15:47,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:15:47,208 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:15:47,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/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-23 13:15:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:15:47,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:15:47,350 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:15:47,350 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 13:15:47,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:47 BoogieIcfgContainer [2018-11-23 13:15:47,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:15:47,351 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:15:47,351 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:15:47,354 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:15:47,354 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:15:47,354 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:15:47" (1/3) ... [2018-11-23 13:15:47,355 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1348a5d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:15:47, skipping insertion in model container [2018-11-23 13:15:47,355 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:15:47,355 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:47" (2/3) ... [2018-11-23 13:15:47,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1348a5d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:15:47, skipping insertion in model container [2018-11-23 13:15:47,356 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:15:47,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:47" (3/3) ... [2018-11-23 13:15:47,357 INFO L375 chiAutomizerObserver]: Analyzing ICFG NO_22_false-termination_true-no-overflow.c [2018-11-23 13:15:47,403 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:15:47,403 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:15:47,403 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:15:47,403 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:15:47,404 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:15:47,404 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:15:47,404 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:15:47,404 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:15:47,404 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:15:47,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-11-23 13:15:47,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:15:47,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:47,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:47,428 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 13:15:47,428 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:15:47,428 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:15:47,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-11-23 13:15:47,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:15:47,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:47,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:47,429 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 13:15:47,429 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:15:47,435 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 7#L10-2true [2018-11-23 13:15:47,436 INFO L796 eck$LassoCheckResult]: Loop: 7#L10-2true assume !!(main_~i~0 < 100); 3#L10true assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7#L10-2true [2018-11-23 13:15:47,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:47,441 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-23 13:15:47,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:47,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:47,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:47,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:47,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:47,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:47,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2018-11-23 13:15:47,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:47,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:47,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:47,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:47,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:47,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:47,507 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2018-11-23 13:15:47,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:47,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:47,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:47,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:47,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:47,549 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:15:47,550 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:15:47,550 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:15:47,550 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:15:47,550 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:15:47,550 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:47,550 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:15:47,550 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:15:47,551 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-23 13:15:47,551 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:15:47,551 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:15:47,570 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-23 13:15:47,596 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-23 13:15:47,599 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-23 13:15:47,653 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:15:47,654 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:47,657 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:15:47,657 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:15:47,675 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:15:47,675 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:47,677 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:15:47,678 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:15:47,692 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:15:47,693 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:47,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:15:47,695 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:47,711 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:15:47,711 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:15:47,732 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:15:47,732 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:15:47,733 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:15:47,733 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:15:47,733 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:15:47,733 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:15:47,733 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:47,733 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:15:47,733 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:15:47,733 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-23 13:15:47,733 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:15:47,733 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:15:47,735 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-23 13:15:47,744 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-23 13:15:47,746 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-23 13:15:47,802 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:15:47,805 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:15:47,806 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-23 13:15:47,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:15:47,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:15:47,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:15:47,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:15:47,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:15:47,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:15:47,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:15:47,817 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-23 13:15:47,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:15:47,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:15:47,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:15:47,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:15:47,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:15:47,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:15:47,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:15:47,827 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-23 13:15:47,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:15:47,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:15:47,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:15:47,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:15:47,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:15:47,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:15:47,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:15:47,832 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:15:47,835 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:15:47,835 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 13:15:47,836 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:15:47,836 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:15:47,836 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:15:47,836 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 99 Supporting invariants [] [2018-11-23 13:15:47,837 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:15:47,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:47,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:47,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:47,902 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-23 13:15:47,911 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-23 13:15:47,912 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2018-11-23 13:15:47,945 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2018-11-23 13:15:47,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:15:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:15:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-23 13:15:47,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2018-11-23 13:15:47,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:47,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-23 13:15:47,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:47,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-23 13:15:47,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:47,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-23 13:15:47,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:15:47,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2018-11-23 13:15:47,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-23 13:15:47,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-23 13:15:47,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2018-11-23 13:15:47,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:47,957 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-23 13:15:47,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2018-11-23 13:15:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-23 13:15:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:15:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-11-23 13:15:47,973 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-23 13:15:47,973 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-23 13:15:47,973 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:15:47,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2018-11-23 13:15:47,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:15:47,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:47,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:47,974 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:15:47,974 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:15:47,974 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 68#L10-2 assume !!(main_~i~0 < 100); 63#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 64#L10-2 [2018-11-23 13:15:47,974 INFO L796 eck$LassoCheckResult]: Loop: 64#L10-2 assume !!(main_~i~0 < 100); 69#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 64#L10-2 [2018-11-23 13:15:47,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:47,975 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-11-23 13:15:47,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:47,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:47,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:47,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:47,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,006 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-23 13:15:48,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:15:48,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-23 13:15:48,009 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:15:48,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2018-11-23 13:15:48,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:48,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:48,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:48,022 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:15:48,022 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:15:48,022 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:15:48,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:15:48,022 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:15:48,022 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:48,022 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:15:48,023 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:15:48,023 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-23 13:15:48,023 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:15:48,023 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:15:48,024 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-23 13:15:48,026 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-23 13:15:48,028 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-23 13:15:48,051 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:15:48,052 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:48,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:15:48,062 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:15:48,090 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:15:48,090 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:48,092 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:15:48,093 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:15:48,107 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:15:48,107 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:48,111 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:15:48,111 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:48,127 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:15:48,127 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:15:48,143 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:15:48,143 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:15:48,144 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:15:48,144 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:15:48,144 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:15:48,144 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:15:48,144 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:48,144 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:15:48,144 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:15:48,144 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-23 13:15:48,144 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:15:48,144 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:15:48,145 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-23 13:15:48,147 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-23 13:15:48,155 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-23 13:15:48,174 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:15:48,174 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:15:48,174 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-23 13:15:48,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:15:48,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:15:48,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:15:48,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:15:48,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:15:48,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:15:48,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:15:48,180 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-23 13:15:48,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:15:48,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:15:48,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:15:48,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:15:48,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:15:48,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:15:48,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:15:48,185 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:15:48,187 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:15:48,188 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 13:15:48,188 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:15:48,188 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:15:48,188 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:15:48,188 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 99 Supporting invariants [] [2018-11-23 13:15:48,189 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:15:48,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,222 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-23 13:15:48,222 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-23 13:15:48,222 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 13:15:48,238 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2018-11-23 13:15:48,238 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-23 13:15:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:15:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-23 13:15:48,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-23 13:15:48,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:48,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 13:15:48,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:48,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-23 13:15:48,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:48,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2018-11-23 13:15:48,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:15:48,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2018-11-23 13:15:48,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 13:15:48,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 13:15:48,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2018-11-23 13:15:48,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:48,242 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-23 13:15:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2018-11-23 13:15:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-23 13:15:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:15:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-11-23 13:15:48,243 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-23 13:15:48,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:15:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:15:48,248 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 3 states. [2018-11-23 13:15:48,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:48,254 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2018-11-23 13:15:48,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:15:48,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-11-23 13:15:48,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:15:48,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2018-11-23 13:15:48,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 13:15:48,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 13:15:48,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-23 13:15:48,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:48,256 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 13:15:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-23 13:15:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-23 13:15:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:15:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-23 13:15:48,258 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-23 13:15:48,258 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-23 13:15:48,258 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:15:48,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-23 13:15:48,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:15:48,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:48,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:48,259 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1] [2018-11-23 13:15:48,260 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:15:48,260 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 144#L10-2 assume !!(main_~i~0 < 100); 145#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 149#L10-2 assume !!(main_~i~0 < 100); 139#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 140#L10-2 assume !!(main_~i~0 < 100); 146#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 148#L10-2 [2018-11-23 13:15:48,260 INFO L796 eck$LassoCheckResult]: Loop: 148#L10-2 assume !!(main_~i~0 < 100); 147#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 148#L10-2 [2018-11-23 13:15:48,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1366043347, now seen corresponding path program 1 times [2018-11-23 13:15:48,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:48,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:48,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:48,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:48,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:48,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:48,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:48,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:48,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-23 13:15:48,307 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:15:48,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2018-11-23 13:15:48,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:48,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:48,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:48,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:48,325 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:15:48,325 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:15:48,325 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:15:48,325 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:15:48,325 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:15:48,325 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:48,326 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:15:48,326 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:15:48,326 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-23 13:15:48,326 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:15:48,326 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:15:48,327 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-23 13:15:48,338 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-23 13:15:48,341 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-23 13:15:48,365 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:15:48,366 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/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-23 13:15:48,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:15:48,370 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:15:48,385 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:15:48,385 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/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-23 13:15:48,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:15:48,388 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/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-23 13:15:48,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:15:48,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:15:48,429 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:15:48,430 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:15:48,430 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:15:48,430 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:15:48,431 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:15:48,431 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:15:48,431 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:48,431 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:15:48,431 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:15:48,431 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-23 13:15:48,431 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:15:48,431 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:15:48,433 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-23 13:15:48,438 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-23 13:15:48,441 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-23 13:15:48,471 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:15:48,471 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:15:48,471 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-23 13:15:48,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:15:48,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:15:48,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:15:48,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:15:48,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:15:48,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:15:48,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:15:48,478 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-23 13:15:48,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:15:48,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:15:48,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:15:48,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:15:48,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:15:48,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:15:48,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:15:48,482 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:15:48,484 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:15:48,484 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 13:15:48,484 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:15:48,484 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:15:48,485 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:15:48,485 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 99 Supporting invariants [] [2018-11-23 13:15:48,485 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:15:48,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,509 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-23 13:15:48,510 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-23 13:15:48,510 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 13:15:48,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 13 states and 19 transitions. Complement of second has 5 states. [2018-11-23 13:15:48,520 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-23 13:15:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:15:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-23 13:15:48,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 13:15:48,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:48,521 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:15:48,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,554 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-23 13:15:48,554 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-23 13:15:48,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 13:15:48,560 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 13 states and 19 transitions. Complement of second has 5 states. [2018-11-23 13:15:48,561 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-23 13:15:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:15:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-23 13:15:48,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 13:15:48,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:48,562 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:15:48,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,580 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-23 13:15:48,580 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-23 13:15:48,580 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 13:15:48,589 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 15 states and 22 transitions. Complement of second has 4 states. [2018-11-23 13:15:48,590 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-23 13:15:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:15:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-23 13:15:48,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 13:15:48,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:48,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 13:15:48,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:48,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-23 13:15:48,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:48,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2018-11-23 13:15:48,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:15:48,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 18 transitions. [2018-11-23 13:15:48,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-23 13:15:48,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 13:15:48,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2018-11-23 13:15:48,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:48,592 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-23 13:15:48,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2018-11-23 13:15:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 6. [2018-11-23 13:15:48,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:15:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2018-11-23 13:15:48,593 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2018-11-23 13:15:48,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:15:48,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:15:48,593 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand 4 states. [2018-11-23 13:15:48,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:48,603 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-11-23 13:15:48,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:15:48,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2018-11-23 13:15:48,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:15:48,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 11 transitions. [2018-11-23 13:15:48,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-23 13:15:48,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-11-23 13:15:48,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-11-23 13:15:48,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:48,605 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-23 13:15:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-11-23 13:15:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-11-23 13:15:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:15:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-11-23 13:15:48,607 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-23 13:15:48,607 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-23 13:15:48,607 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:15:48,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-11-23 13:15:48,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:15:48,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:48,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:48,608 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1] [2018-11-23 13:15:48,608 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:15:48,608 INFO L794 eck$LassoCheckResult]: Stem: 339#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 340#L10-2 assume !!(main_~i~0 < 100); 337#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 338#L10-2 assume !!(main_~i~0 < 100); 341#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 342#L10-2 assume !!(main_~i~0 < 100); 335#L10 [2018-11-23 13:15:48,608 INFO L796 eck$LassoCheckResult]: Loop: 335#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 336#L10-2 assume !!(main_~i~0 < 100); 335#L10 [2018-11-23 13:15:48,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,608 INFO L82 PathProgramCache]: Analyzing trace with hash 925765348, now seen corresponding path program 2 times [2018-11-23 13:15:48,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:48,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:48,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:48,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:48,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 1 times [2018-11-23 13:15:48,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:48,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:48,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:48,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:48,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,620 INFO L82 PathProgramCache]: Analyzing trace with hash 602269631, now seen corresponding path program 2 times [2018-11-23 13:15:48,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:48,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:48,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:48,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:48,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:48,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:48,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:15:48,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:15:48,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:48,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:48,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:48,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 13:15:48,684 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:15:48,684 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:15:48,684 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:15:48,684 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:15:48,684 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:15:48,684 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:48,684 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:15:48,684 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:15:48,685 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-23 13:15:48,685 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:15:48,685 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:15:48,686 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-23 13:15:48,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:15:48,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:15:48,728 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:15:48,728 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/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-23 13:15:48,730 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:15:48,730 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:15:48,745 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:15:48,745 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/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-23 13:15:48,748 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:15:48,748 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/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-23 13:15:48,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:15:48,764 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:15:48,780 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:15:48,781 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:15:48,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:15:48,781 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:15:48,781 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:15:48,781 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:15:48,781 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:15:48,781 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:15:48,781 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:15:48,781 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_22_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-23 13:15:48,781 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:15:48,782 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:15:48,782 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-23 13:15:48,787 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-23 13:15:48,788 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-23 13:15:48,814 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:15:48,814 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:15:48,814 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-23 13:15:48,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:15:48,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:15:48,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:15:48,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:15:48,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:15:48,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:15:48,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:15:48,818 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:15:48,820 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:15:48,820 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:15:48,820 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:15:48,820 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:15:48,821 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:15:48,821 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 13:15:48,821 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:15:48,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,859 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-23 13:15:48,859 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-23 13:15:48,859 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-23 13:15:48,862 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 8 states and 10 transitions. Complement of second has 3 states. [2018-11-23 13:15:48,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-23 13:15:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:15:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2018-11-23 13:15:48,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-23 13:15:48,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:48,864 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:15:48,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,888 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-23 13:15:48,889 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:15:48,889 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-23 13:15:48,891 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 8 states and 10 transitions. Complement of second has 3 states. [2018-11-23 13:15:48,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-23 13:15:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:15:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2018-11-23 13:15:48,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-23 13:15:48,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:48,892 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:15:48,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:48,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:48,928 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-23 13:15:48,928 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:15:48,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-23 13:15:48,941 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 12 states and 14 transitions. Complement of second has 4 states. [2018-11-23 13:15:48,941 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-23 13:15:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:15:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-23 13:15:48,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-23 13:15:48,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:48,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 13:15:48,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:48,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 13:15:48,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:15:48,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-11-23 13:15:48,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 13:15:48,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 12 transitions. [2018-11-23 13:15:48,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:48,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:48,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-11-23 13:15:48,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:48,944 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-23 13:15:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-11-23 13:15:48,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-11-23 13:15:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:15:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-23 13:15:48,945 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-23 13:15:48,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:15:48,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:15:48,945 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-11-23 13:15:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:48,952 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-11-23 13:15:48,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:15:48,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-11-23 13:15:48,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:48,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 14 transitions. [2018-11-23 13:15:48,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:48,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:48,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2018-11-23 13:15:48,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:48,953 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-23 13:15:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2018-11-23 13:15:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-23 13:15:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:15:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-11-23 13:15:48,954 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-23 13:15:48,954 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-23 13:15:48,954 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 13:15:48,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2018-11-23 13:15:48,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:48,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:48,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:48,955 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 1] [2018-11-23 13:15:48,955 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:48,955 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 520#L10-2 assume !!(main_~i~0 < 100); 517#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 518#L10-2 assume !!(main_~i~0 < 100); 521#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 524#L10-2 assume !!(main_~i~0 < 100); 523#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 522#L10-2 assume !!(main_~i~0 < 100); 515#L10 [2018-11-23 13:15:48,955 INFO L796 eck$LassoCheckResult]: Loop: 515#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 516#L10-2 assume !!(main_~i~0 < 100); 523#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 522#L10-2 assume !!(main_~i~0 < 100); 515#L10 [2018-11-23 13:15:48,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,955 INFO L82 PathProgramCache]: Analyzing trace with hash 602269569, now seen corresponding path program 3 times [2018-11-23 13:15:48,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:48,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:48,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:48,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:48,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2018-11-23 13:15:48,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:48,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:48,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:48,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:48,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:48,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1740322745, now seen corresponding path program 3 times [2018-11-23 13:15:48,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:48,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:48,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:48,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:49,008 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:49,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:15:49,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 13:15:49,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:49,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:49,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 13:15:49,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:15:49,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:15:49,048 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-23 13:15:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:49,058 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 13:15:49,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:15:49,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-23 13:15:49,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2018-11-23 13:15:49,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:49,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:49,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-23 13:15:49,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:49,059 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 13:15:49,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-23 13:15:49,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-23 13:15:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:15:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-23 13:15:49,061 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 13:15:49,061 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 13:15:49,061 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 13:15:49,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-23 13:15:49,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:49,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:49,062 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 1] [2018-11-23 13:15:49,062 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:49,062 INFO L794 eck$LassoCheckResult]: Stem: 589#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 590#L10-2 assume !!(main_~i~0 < 100); 587#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 588#L10-2 assume !!(main_~i~0 < 100); 591#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 597#L10-2 assume !!(main_~i~0 < 100); 595#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 594#L10-2 assume !!(main_~i~0 < 100); 593#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 592#L10-2 assume !!(main_~i~0 < 100); 585#L10 [2018-11-23 13:15:49,062 INFO L796 eck$LassoCheckResult]: Loop: 585#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 586#L10-2 assume !!(main_~i~0 < 100); 593#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 592#L10-2 assume !!(main_~i~0 < 100); 585#L10 [2018-11-23 13:15:49,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1039528738, now seen corresponding path program 4 times [2018-11-23 13:15:49,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 2 times [2018-11-23 13:15:49,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1650681494, now seen corresponding path program 4 times [2018-11-23 13:15:49,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:49,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:49,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:15:49,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:15:49,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:49,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:49,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 13:15:49,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:15:49,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:15:49,159 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-23 13:15:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:49,170 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-23 13:15:49,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:15:49,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-11-23 13:15:49,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 18 transitions. [2018-11-23 13:15:49,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:49,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:49,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2018-11-23 13:15:49,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:49,172 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 13:15:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2018-11-23 13:15:49,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 13:15:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:15:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-23 13:15:49,173 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 13:15:49,173 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 13:15:49,173 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 13:15:49,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:15:49,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:49,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:49,174 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 1] [2018-11-23 13:15:49,174 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:49,174 INFO L794 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 671#L10-2 assume !!(main_~i~0 < 100); 668#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 669#L10-2 assume !!(main_~i~0 < 100); 672#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 680#L10-2 assume !!(main_~i~0 < 100); 679#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 678#L10-2 assume !!(main_~i~0 < 100); 676#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 675#L10-2 assume !!(main_~i~0 < 100); 674#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 673#L10-2 assume !!(main_~i~0 < 100); 666#L10 [2018-11-23 13:15:49,174 INFO L796 eck$LassoCheckResult]: Loop: 666#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 667#L10-2 assume !!(main_~i~0 < 100); 674#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 673#L10-2 assume !!(main_~i~0 < 100); 666#L10 [2018-11-23 13:15:49,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1740263163, now seen corresponding path program 5 times [2018-11-23 13:15:49,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 3 times [2018-11-23 13:15:49,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1404785203, now seen corresponding path program 5 times [2018-11-23 13:15:49,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:49,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:49,238 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:15:49,243 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-23 13:15:49,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:49,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:49,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 13:15:49,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:15:49,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:15:49,281 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-23 13:15:49,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:49,308 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 13:15:49,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:15:49,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-11-23 13:15:49,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 20 transitions. [2018-11-23 13:15:49,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:49,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:49,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2018-11-23 13:15:49,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:49,310 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-23 13:15:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2018-11-23 13:15:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 13:15:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:15:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 13:15:49,311 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 13:15:49,311 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 13:15:49,311 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 13:15:49,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-23 13:15:49,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:49,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:49,312 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 1] [2018-11-23 13:15:49,312 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:49,312 INFO L794 eck$LassoCheckResult]: Stem: 762#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 763#L10-2 assume !!(main_~i~0 < 100); 764#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 765#L10-2 assume !!(main_~i~0 < 100); 760#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 761#L10-2 assume !!(main_~i~0 < 100); 774#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 773#L10-2 assume !!(main_~i~0 < 100); 772#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 771#L10-2 assume !!(main_~i~0 < 100); 769#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 768#L10-2 assume !!(main_~i~0 < 100); 767#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 766#L10-2 assume !!(main_~i~0 < 100); 758#L10 [2018-11-23 13:15:49,312 INFO L796 eck$LassoCheckResult]: Loop: 758#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 759#L10-2 assume !!(main_~i~0 < 100); 767#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 766#L10-2 assume !!(main_~i~0 < 100); 758#L10 [2018-11-23 13:15:49,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1650621912, now seen corresponding path program 6 times [2018-11-23 13:15:49,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 4 times [2018-11-23 13:15:49,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1321650832, now seen corresponding path program 6 times [2018-11-23 13:15:49,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:49,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:49,368 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:15:49,374 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 13:15:49,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:49,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:49,379 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:49,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 13:15:49,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:15:49,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:15:49,407 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-11-23 13:15:49,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:49,420 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 13:15:49,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:15:49,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2018-11-23 13:15:49,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 22 transitions. [2018-11-23 13:15:49,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:49,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:49,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-11-23 13:15:49,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:49,421 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 13:15:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-11-23 13:15:49,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 13:15:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:15:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 13:15:49,422 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 13:15:49,422 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 13:15:49,422 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 13:15:49,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2018-11-23 13:15:49,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:49,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:49,423 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 1] [2018-11-23 13:15:49,423 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:49,423 INFO L794 eck$LassoCheckResult]: Stem: 865#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 866#L10-2 assume !!(main_~i~0 < 100); 867#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 868#L10-2 assume !!(main_~i~0 < 100); 863#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 864#L10-2 assume !!(main_~i~0 < 100); 879#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 878#L10-2 assume !!(main_~i~0 < 100); 877#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 876#L10-2 assume !!(main_~i~0 < 100); 875#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 874#L10-2 assume !!(main_~i~0 < 100); 872#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 871#L10-2 assume !!(main_~i~0 < 100); 870#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 869#L10-2 assume !!(main_~i~0 < 100); 861#L10 [2018-11-23 13:15:49,423 INFO L796 eck$LassoCheckResult]: Loop: 861#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 862#L10-2 assume !!(main_~i~0 < 100); 870#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 869#L10-2 assume !!(main_~i~0 < 100); 861#L10 [2018-11-23 13:15:49,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1404725621, now seen corresponding path program 7 times [2018-11-23 13:15:49,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 5 times [2018-11-23 13:15:49,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:49,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1261068371, now seen corresponding path program 7 times [2018-11-23 13:15:49,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:49,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:49,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:49,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:49,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 13:15:49,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:15:49,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:15:49,524 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-11-23 13:15:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:49,540 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 13:15:49,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:15:49,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-11-23 13:15:49,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 24 transitions. [2018-11-23 13:15:49,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:49,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:49,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2018-11-23 13:15:49,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:49,542 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 13:15:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2018-11-23 13:15:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 13:15:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:15:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 13:15:49,543 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 13:15:49,543 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 13:15:49,543 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 13:15:49,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2018-11-23 13:15:49,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:49,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:49,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 1] [2018-11-23 13:15:49,544 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:49,545 INFO L794 eck$LassoCheckResult]: Stem: 979#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 980#L10-2 assume !!(main_~i~0 < 100); 981#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 982#L10-2 assume !!(main_~i~0 < 100); 977#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 978#L10-2 assume !!(main_~i~0 < 100); 995#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 994#L10-2 assume !!(main_~i~0 < 100); 993#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 992#L10-2 assume !!(main_~i~0 < 100); 991#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 990#L10-2 assume !!(main_~i~0 < 100); 989#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 988#L10-2 assume !!(main_~i~0 < 100); 986#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 985#L10-2 assume !!(main_~i~0 < 100); 984#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 983#L10-2 assume !!(main_~i~0 < 100); 975#L10 [2018-11-23 13:15:49,545 INFO L796 eck$LassoCheckResult]: Loop: 975#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 976#L10-2 assume !!(main_~i~0 < 100); 984#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 983#L10-2 assume !!(main_~i~0 < 100); 975#L10 [2018-11-23 13:15:49,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1321591250, now seen corresponding path program 8 times [2018-11-23 13:15:49,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:49,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 6 times [2018-11-23 13:15:49,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,557 INFO L82 PathProgramCache]: Analyzing trace with hash -763125366, now seen corresponding path program 8 times [2018-11-23 13:15:49,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:49,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:49,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:15:49,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:15:49,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:49,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:49,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 13:15:49,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:15:49,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:15:49,641 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. cyclomatic complexity: 3 Second operand 11 states. [2018-11-23 13:15:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:49,656 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 13:15:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:15:49,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2018-11-23 13:15:49,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 26 transitions. [2018-11-23 13:15:49,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:49,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:49,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2018-11-23 13:15:49,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:49,657 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 13:15:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2018-11-23 13:15:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 13:15:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:15:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 13:15:49,659 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 13:15:49,659 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 13:15:49,659 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 13:15:49,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2018-11-23 13:15:49,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:49,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:49,660 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 1] [2018-11-23 13:15:49,660 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:49,660 INFO L794 eck$LassoCheckResult]: Stem: 1104#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 1105#L10-2 assume !!(main_~i~0 < 100); 1106#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1107#L10-2 assume !!(main_~i~0 < 100); 1102#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1103#L10-2 assume !!(main_~i~0 < 100); 1122#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1121#L10-2 assume !!(main_~i~0 < 100); 1120#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1119#L10-2 assume !!(main_~i~0 < 100); 1118#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1117#L10-2 assume !!(main_~i~0 < 100); 1116#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1115#L10-2 assume !!(main_~i~0 < 100); 1114#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1113#L10-2 assume !!(main_~i~0 < 100); 1111#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1110#L10-2 assume !!(main_~i~0 < 100); 1109#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1108#L10-2 assume !!(main_~i~0 < 100); 1100#L10 [2018-11-23 13:15:49,660 INFO L796 eck$LassoCheckResult]: Loop: 1100#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1101#L10-2 assume !!(main_~i~0 < 100); 1109#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1108#L10-2 assume !!(main_~i~0 < 100); 1100#L10 [2018-11-23 13:15:49,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1261127953, now seen corresponding path program 9 times [2018-11-23 13:15:49,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 7 times [2018-11-23 13:15:49,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1018732583, now seen corresponding path program 9 times [2018-11-23 13:15:49,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:49,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:49,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:49,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:15:49,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 13:15:49,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:49,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:49,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 13:15:49,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:15:49,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:15:49,766 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-23 13:15:49,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:49,782 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 13:15:49,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:15:49,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2018-11-23 13:15:49,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 28 transitions. [2018-11-23 13:15:49,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:49,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:49,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2018-11-23 13:15:49,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:49,784 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 13:15:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2018-11-23 13:15:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 13:15:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:15:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 13:15:49,785 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 13:15:49,785 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 13:15:49,785 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 13:15:49,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:15:49,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:49,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:49,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 1] [2018-11-23 13:15:49,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:49,787 INFO L794 eck$LassoCheckResult]: Stem: 1240#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 1241#L10-2 assume !!(main_~i~0 < 100); 1242#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1243#L10-2 assume !!(main_~i~0 < 100); 1238#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1239#L10-2 assume !!(main_~i~0 < 100); 1260#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1259#L10-2 assume !!(main_~i~0 < 100); 1258#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1257#L10-2 assume !!(main_~i~0 < 100); 1256#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1255#L10-2 assume !!(main_~i~0 < 100); 1254#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1253#L10-2 assume !!(main_~i~0 < 100); 1252#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1251#L10-2 assume !!(main_~i~0 < 100); 1250#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1249#L10-2 assume !!(main_~i~0 < 100); 1247#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1246#L10-2 assume !!(main_~i~0 < 100); 1245#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1244#L10-2 assume !!(main_~i~0 < 100); 1236#L10 [2018-11-23 13:15:49,787 INFO L796 eck$LassoCheckResult]: Loop: 1236#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1237#L10-2 assume !!(main_~i~0 < 100); 1245#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1244#L10-2 assume !!(main_~i~0 < 100); 1236#L10 [2018-11-23 13:15:49,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,787 INFO L82 PathProgramCache]: Analyzing trace with hash -763184948, now seen corresponding path program 10 times [2018-11-23 13:15:49,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 8 times [2018-11-23 13:15:49,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,798 INFO L82 PathProgramCache]: Analyzing trace with hash -307729532, now seen corresponding path program 10 times [2018-11-23 13:15:49,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:49,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:49,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:15:49,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:15:49,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:49,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:49,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:49,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-23 13:15:49,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:15:49,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:15:49,934 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. cyclomatic complexity: 3 Second operand 13 states. [2018-11-23 13:15:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:49,957 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:15:49,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:15:49,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2018-11-23 13:15:49,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 30 transitions. [2018-11-23 13:15:49,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:49,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:49,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 30 transitions. [2018-11-23 13:15:49,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:49,958 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 13:15:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 30 transitions. [2018-11-23 13:15:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 13:15:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:15:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 13:15:49,960 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 13:15:49,960 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 13:15:49,960 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 13:15:49,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2018-11-23 13:15:49,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:49,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:49,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:49,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 1] [2018-11-23 13:15:49,961 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:49,961 INFO L794 eck$LassoCheckResult]: Stem: 1387#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 1388#L10-2 assume !!(main_~i~0 < 100); 1389#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1390#L10-2 assume !!(main_~i~0 < 100); 1385#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1386#L10-2 assume !!(main_~i~0 < 100); 1409#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1408#L10-2 assume !!(main_~i~0 < 100); 1407#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1406#L10-2 assume !!(main_~i~0 < 100); 1405#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1404#L10-2 assume !!(main_~i~0 < 100); 1403#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1402#L10-2 assume !!(main_~i~0 < 100); 1401#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1400#L10-2 assume !!(main_~i~0 < 100); 1399#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1398#L10-2 assume !!(main_~i~0 < 100); 1397#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1396#L10-2 assume !!(main_~i~0 < 100); 1394#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1393#L10-2 assume !!(main_~i~0 < 100); 1392#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1391#L10-2 assume !!(main_~i~0 < 100); 1383#L10 [2018-11-23 13:15:49,961 INFO L796 eck$LassoCheckResult]: Loop: 1383#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1384#L10-2 assume !!(main_~i~0 < 100); 1392#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1391#L10-2 assume !!(main_~i~0 < 100); 1383#L10 [2018-11-23 13:15:49,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1018673001, now seen corresponding path program 11 times [2018-11-23 13:15:49,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 9 times [2018-11-23 13:15:49,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:49,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:49,970 INFO L82 PathProgramCache]: Analyzing trace with hash 567464865, now seen corresponding path program 11 times [2018-11-23 13:15:49,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:49,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:49,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:49,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 36 proven. 132 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:50,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:50,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:50,057 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:15:50,067 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-11-23 13:15:50,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:50,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 36 proven. 132 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:50,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:50,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-23 13:15:50,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:15:50,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:15:50,101 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. cyclomatic complexity: 3 Second operand 14 states. [2018-11-23 13:15:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:50,135 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 13:15:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:15:50,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2018-11-23 13:15:50,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:50,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 32 transitions. [2018-11-23 13:15:50,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:50,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:50,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2018-11-23 13:15:50,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:50,137 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 13:15:50,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2018-11-23 13:15:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 13:15:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:15:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-23 13:15:50,138 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-23 13:15:50,138 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-23 13:15:50,138 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 13:15:50,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:15:50,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:50,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:50,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:50,139 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 1] [2018-11-23 13:15:50,139 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:50,139 INFO L794 eck$LassoCheckResult]: Stem: 1545#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 1546#L10-2 assume !!(main_~i~0 < 100); 1547#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1548#L10-2 assume !!(main_~i~0 < 100); 1543#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1544#L10-2 assume !!(main_~i~0 < 100); 1569#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1568#L10-2 assume !!(main_~i~0 < 100); 1567#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1566#L10-2 assume !!(main_~i~0 < 100); 1565#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1564#L10-2 assume !!(main_~i~0 < 100); 1563#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1562#L10-2 assume !!(main_~i~0 < 100); 1561#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1560#L10-2 assume !!(main_~i~0 < 100); 1559#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1558#L10-2 assume !!(main_~i~0 < 100); 1557#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1556#L10-2 assume !!(main_~i~0 < 100); 1555#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1554#L10-2 assume !!(main_~i~0 < 100); 1552#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1551#L10-2 assume !!(main_~i~0 < 100); 1550#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1549#L10-2 assume !!(main_~i~0 < 100); 1541#L10 [2018-11-23 13:15:50,139 INFO L796 eck$LassoCheckResult]: Loop: 1541#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1542#L10-2 assume !!(main_~i~0 < 100); 1550#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1549#L10-2 assume !!(main_~i~0 < 100); 1541#L10 [2018-11-23 13:15:50,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:50,140 INFO L82 PathProgramCache]: Analyzing trace with hash -307789114, now seen corresponding path program 12 times [2018-11-23 13:15:50,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:50,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:50,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:50,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:50,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 10 times [2018-11-23 13:15:50,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:50,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:50,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:50,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash -184309634, now seen corresponding path program 12 times [2018-11-23 13:15:50,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:50,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:50,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:50,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 39 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:50,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:50,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:50,280 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:15:50,294 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-23 13:15:50,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:50,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:50,304 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 39 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:50,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:50,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-23 13:15:50,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:15:50,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:15:50,357 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 3 Second operand 15 states. [2018-11-23 13:15:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:50,392 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 13:15:50,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:15:50,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2018-11-23 13:15:50,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:50,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 34 transitions. [2018-11-23 13:15:50,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:50,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:50,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 34 transitions. [2018-11-23 13:15:50,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:50,394 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 13:15:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 34 transitions. [2018-11-23 13:15:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 13:15:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:15:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-23 13:15:50,396 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 13:15:50,396 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 13:15:50,396 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 13:15:50,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2018-11-23 13:15:50,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:50,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:50,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:50,401 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [14, 13, 1] [2018-11-23 13:15:50,401 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:50,401 INFO L794 eck$LassoCheckResult]: Stem: 1714#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 1715#L10-2 assume !!(main_~i~0 < 100); 1716#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1717#L10-2 assume !!(main_~i~0 < 100); 1712#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1713#L10-2 assume !!(main_~i~0 < 100); 1740#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1739#L10-2 assume !!(main_~i~0 < 100); 1738#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1737#L10-2 assume !!(main_~i~0 < 100); 1736#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1735#L10-2 assume !!(main_~i~0 < 100); 1734#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1733#L10-2 assume !!(main_~i~0 < 100); 1732#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1731#L10-2 assume !!(main_~i~0 < 100); 1730#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1729#L10-2 assume !!(main_~i~0 < 100); 1728#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1727#L10-2 assume !!(main_~i~0 < 100); 1726#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1725#L10-2 assume !!(main_~i~0 < 100); 1724#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1723#L10-2 assume !!(main_~i~0 < 100); 1721#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1720#L10-2 assume !!(main_~i~0 < 100); 1719#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1718#L10-2 assume !!(main_~i~0 < 100); 1710#L10 [2018-11-23 13:15:50,402 INFO L796 eck$LassoCheckResult]: Loop: 1710#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1711#L10-2 assume !!(main_~i~0 < 100); 1719#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1718#L10-2 assume !!(main_~i~0 < 100); 1710#L10 [2018-11-23 13:15:50,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:50,402 INFO L82 PathProgramCache]: Analyzing trace with hash 567405283, now seen corresponding path program 13 times [2018-11-23 13:15:50,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:50,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:50,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:50,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:50,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 11 times [2018-11-23 13:15:50,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:50,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:50,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:50,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:50,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1085097445, now seen corresponding path program 13 times [2018-11-23 13:15:50,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:50,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:50,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:50,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:50,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:50,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:50,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:50,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:50,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:50,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-23 13:15:50,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:15:50,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:15:50,574 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. cyclomatic complexity: 3 Second operand 16 states. [2018-11-23 13:15:50,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:50,600 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 13:15:50,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:15:50,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2018-11-23 13:15:50,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:50,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 36 transitions. [2018-11-23 13:15:50,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:50,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:50,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 36 transitions. [2018-11-23 13:15:50,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:50,602 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-23 13:15:50,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 36 transitions. [2018-11-23 13:15:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 13:15:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:15:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-23 13:15:50,603 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 13:15:50,603 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 13:15:50,603 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 13:15:50,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2018-11-23 13:15:50,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:50,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:50,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:50,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [15, 14, 1] [2018-11-23 13:15:50,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:50,604 INFO L794 eck$LassoCheckResult]: Stem: 1894#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 1895#L10-2 assume !!(main_~i~0 < 100); 1896#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1897#L10-2 assume !!(main_~i~0 < 100); 1892#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1893#L10-2 assume !!(main_~i~0 < 100); 1922#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1921#L10-2 assume !!(main_~i~0 < 100); 1920#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1919#L10-2 assume !!(main_~i~0 < 100); 1918#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1917#L10-2 assume !!(main_~i~0 < 100); 1916#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1915#L10-2 assume !!(main_~i~0 < 100); 1914#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1913#L10-2 assume !!(main_~i~0 < 100); 1912#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1911#L10-2 assume !!(main_~i~0 < 100); 1910#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1909#L10-2 assume !!(main_~i~0 < 100); 1908#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1907#L10-2 assume !!(main_~i~0 < 100); 1906#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1905#L10-2 assume !!(main_~i~0 < 100); 1904#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1903#L10-2 assume !!(main_~i~0 < 100); 1901#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1900#L10-2 assume !!(main_~i~0 < 100); 1899#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1898#L10-2 assume !!(main_~i~0 < 100); 1890#L10 [2018-11-23 13:15:50,605 INFO L796 eck$LassoCheckResult]: Loop: 1890#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 1891#L10-2 assume !!(main_~i~0 < 100); 1899#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 1898#L10-2 assume !!(main_~i~0 < 100); 1890#L10 [2018-11-23 13:15:50,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:50,605 INFO L82 PathProgramCache]: Analyzing trace with hash -184369216, now seen corresponding path program 14 times [2018-11-23 13:15:50,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:50,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:50,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:50,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 12 times [2018-11-23 13:15:50,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:50,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:50,616 INFO L82 PathProgramCache]: Analyzing trace with hash 841209976, now seen corresponding path program 14 times [2018-11-23 13:15:50,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:50,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:50,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:50,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:50,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:50,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:50,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:15:50,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:15:50,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:50,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:50,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:50,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-23 13:15:50,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:15:50,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:15:50,762 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 3 Second operand 17 states. [2018-11-23 13:15:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:50,796 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 13:15:50,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:15:50,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 39 transitions. [2018-11-23 13:15:50,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:50,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 38 transitions. [2018-11-23 13:15:50,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:50,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:50,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2018-11-23 13:15:50,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:50,798 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-23 13:15:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2018-11-23 13:15:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 13:15:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:15:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-23 13:15:50,800 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-23 13:15:50,800 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-23 13:15:50,800 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 13:15:50,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 37 transitions. [2018-11-23 13:15:50,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:50,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:50,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:50,801 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 15, 1] [2018-11-23 13:15:50,801 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:50,801 INFO L794 eck$LassoCheckResult]: Stem: 2085#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 2086#L10-2 assume !!(main_~i~0 < 100); 2087#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2088#L10-2 assume !!(main_~i~0 < 100); 2083#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2084#L10-2 assume !!(main_~i~0 < 100); 2115#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2114#L10-2 assume !!(main_~i~0 < 100); 2113#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2112#L10-2 assume !!(main_~i~0 < 100); 2111#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2110#L10-2 assume !!(main_~i~0 < 100); 2109#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2108#L10-2 assume !!(main_~i~0 < 100); 2107#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2106#L10-2 assume !!(main_~i~0 < 100); 2105#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2104#L10-2 assume !!(main_~i~0 < 100); 2103#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2102#L10-2 assume !!(main_~i~0 < 100); 2101#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2100#L10-2 assume !!(main_~i~0 < 100); 2099#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2098#L10-2 assume !!(main_~i~0 < 100); 2097#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2096#L10-2 assume !!(main_~i~0 < 100); 2095#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2094#L10-2 assume !!(main_~i~0 < 100); 2092#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2091#L10-2 assume !!(main_~i~0 < 100); 2090#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2089#L10-2 assume !!(main_~i~0 < 100); 2081#L10 [2018-11-23 13:15:50,801 INFO L796 eck$LassoCheckResult]: Loop: 2081#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2082#L10-2 assume !!(main_~i~0 < 100); 2090#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2089#L10-2 assume !!(main_~i~0 < 100); 2081#L10 [2018-11-23 13:15:50,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:50,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1085157027, now seen corresponding path program 15 times [2018-11-23 13:15:50,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:50,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:50,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:50,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:50,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 13 times [2018-11-23 13:15:50,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:50,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:50,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:50,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:50,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:50,817 INFO L82 PathProgramCache]: Analyzing trace with hash 891736981, now seen corresponding path program 15 times [2018-11-23 13:15:50,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:50,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:50,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:50,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:50,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:50,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:50,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:15:50,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-23 13:15:50,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:50,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:51,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:51,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-11-23 13:15:51,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:15:51,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:15:51,027 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. cyclomatic complexity: 3 Second operand 18 states. [2018-11-23 13:15:51,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:51,057 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 13:15:51,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:15:51,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 41 transitions. [2018-11-23 13:15:51,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:51,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 40 transitions. [2018-11-23 13:15:51,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:51,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:51,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 40 transitions. [2018-11-23 13:15:51,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:51,060 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 13:15:51,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 40 transitions. [2018-11-23 13:15:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-23 13:15:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:15:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-23 13:15:51,061 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-23 13:15:51,061 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-23 13:15:51,062 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-23 13:15:51,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 39 transitions. [2018-11-23 13:15:51,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:51,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:51,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:51,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 16, 1] [2018-11-23 13:15:51,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:51,063 INFO L794 eck$LassoCheckResult]: Stem: 2287#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 2288#L10-2 assume !!(main_~i~0 < 100); 2289#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2290#L10-2 assume !!(main_~i~0 < 100); 2285#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2286#L10-2 assume !!(main_~i~0 < 100); 2319#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2318#L10-2 assume !!(main_~i~0 < 100); 2317#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2316#L10-2 assume !!(main_~i~0 < 100); 2315#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2314#L10-2 assume !!(main_~i~0 < 100); 2313#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2312#L10-2 assume !!(main_~i~0 < 100); 2311#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2310#L10-2 assume !!(main_~i~0 < 100); 2309#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2308#L10-2 assume !!(main_~i~0 < 100); 2307#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2306#L10-2 assume !!(main_~i~0 < 100); 2305#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2304#L10-2 assume !!(main_~i~0 < 100); 2303#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2302#L10-2 assume !!(main_~i~0 < 100); 2301#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2300#L10-2 assume !!(main_~i~0 < 100); 2299#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2298#L10-2 assume !!(main_~i~0 < 100); 2297#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2296#L10-2 assume !!(main_~i~0 < 100); 2294#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2293#L10-2 assume !!(main_~i~0 < 100); 2292#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2291#L10-2 assume !!(main_~i~0 < 100); 2283#L10 [2018-11-23 13:15:51,063 INFO L796 eck$LassoCheckResult]: Loop: 2283#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2284#L10-2 assume !!(main_~i~0 < 100); 2292#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2291#L10-2 assume !!(main_~i~0 < 100); 2283#L10 [2018-11-23 13:15:51,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:51,063 INFO L82 PathProgramCache]: Analyzing trace with hash 841150394, now seen corresponding path program 16 times [2018-11-23 13:15:51,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:51,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:51,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:51,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:51,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 14 times [2018-11-23 13:15:51,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:51,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:51,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:51,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:51,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2091418766, now seen corresponding path program 16 times [2018-11-23 13:15:51,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:51,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 51 proven. 272 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:51,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:51,197 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:51,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:15:51,225 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:15:51,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:51,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 51 proven. 272 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:51,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:51,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-11-23 13:15:51,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:15:51,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:15:51,270 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. cyclomatic complexity: 3 Second operand 19 states. [2018-11-23 13:15:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:51,298 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-23 13:15:51,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:15:51,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2018-11-23 13:15:51,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:51,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 42 transitions. [2018-11-23 13:15:51,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:51,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:51,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 42 transitions. [2018-11-23 13:15:51,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:51,301 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-23 13:15:51,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 42 transitions. [2018-11-23 13:15:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 13:15:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:15:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-23 13:15:51,302 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-23 13:15:51,302 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-23 13:15:51,303 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-23 13:15:51,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:15:51,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:51,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:51,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:51,304 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [18, 17, 1] [2018-11-23 13:15:51,304 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:51,304 INFO L794 eck$LassoCheckResult]: Stem: 2500#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 2501#L10-2 assume !!(main_~i~0 < 100); 2502#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2503#L10-2 assume !!(main_~i~0 < 100); 2498#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2499#L10-2 assume !!(main_~i~0 < 100); 2534#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2533#L10-2 assume !!(main_~i~0 < 100); 2532#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2531#L10-2 assume !!(main_~i~0 < 100); 2530#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2529#L10-2 assume !!(main_~i~0 < 100); 2528#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2527#L10-2 assume !!(main_~i~0 < 100); 2526#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2525#L10-2 assume !!(main_~i~0 < 100); 2524#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2523#L10-2 assume !!(main_~i~0 < 100); 2522#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2521#L10-2 assume !!(main_~i~0 < 100); 2520#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2519#L10-2 assume !!(main_~i~0 < 100); 2518#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2517#L10-2 assume !!(main_~i~0 < 100); 2516#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2515#L10-2 assume !!(main_~i~0 < 100); 2514#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2513#L10-2 assume !!(main_~i~0 < 100); 2512#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2511#L10-2 assume !!(main_~i~0 < 100); 2510#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2509#L10-2 assume !!(main_~i~0 < 100); 2507#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2506#L10-2 assume !!(main_~i~0 < 100); 2505#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2504#L10-2 assume !!(main_~i~0 < 100); 2496#L10 [2018-11-23 13:15:51,304 INFO L796 eck$LassoCheckResult]: Loop: 2496#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2497#L10-2 assume !!(main_~i~0 < 100); 2505#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2504#L10-2 assume !!(main_~i~0 < 100); 2496#L10 [2018-11-23 13:15:51,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash 891677399, now seen corresponding path program 17 times [2018-11-23 13:15:51,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:51,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:51,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:51,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:51,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 15 times [2018-11-23 13:15:51,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:51,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:51,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:51,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:51,315 INFO L82 PathProgramCache]: Analyzing trace with hash 134062095, now seen corresponding path program 17 times [2018-11-23 13:15:51,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:51,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:51,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:51,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:51,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:51,478 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:51,484 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:15:51,496 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2018-11-23 13:15:51,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:51,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:51,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:51,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-11-23 13:15:51,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:15:51,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:15:51,533 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. cyclomatic complexity: 3 Second operand 20 states. [2018-11-23 13:15:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:51,565 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 13:15:51,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:15:51,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 45 transitions. [2018-11-23 13:15:51,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:51,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 44 transitions. [2018-11-23 13:15:51,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:51,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:51,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2018-11-23 13:15:51,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:51,566 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-23 13:15:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2018-11-23 13:15:51,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 13:15:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:15:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-23 13:15:51,567 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-23 13:15:51,567 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-23 13:15:51,567 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-23 13:15:51,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 43 transitions. [2018-11-23 13:15:51,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:51,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:51,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:51,568 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [19, 18, 1] [2018-11-23 13:15:51,568 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:51,568 INFO L794 eck$LassoCheckResult]: Stem: 2724#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 2725#L10-2 assume !!(main_~i~0 < 100); 2726#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2727#L10-2 assume !!(main_~i~0 < 100); 2722#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2723#L10-2 assume !!(main_~i~0 < 100); 2760#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2759#L10-2 assume !!(main_~i~0 < 100); 2758#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2757#L10-2 assume !!(main_~i~0 < 100); 2756#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2755#L10-2 assume !!(main_~i~0 < 100); 2754#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2753#L10-2 assume !!(main_~i~0 < 100); 2752#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2751#L10-2 assume !!(main_~i~0 < 100); 2750#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2749#L10-2 assume !!(main_~i~0 < 100); 2748#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2747#L10-2 assume !!(main_~i~0 < 100); 2746#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2745#L10-2 assume !!(main_~i~0 < 100); 2744#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2743#L10-2 assume !!(main_~i~0 < 100); 2742#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2741#L10-2 assume !!(main_~i~0 < 100); 2740#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2739#L10-2 assume !!(main_~i~0 < 100); 2738#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2737#L10-2 assume !!(main_~i~0 < 100); 2736#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2735#L10-2 assume !!(main_~i~0 < 100); 2734#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2733#L10-2 assume !!(main_~i~0 < 100); 2731#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2730#L10-2 assume !!(main_~i~0 < 100); 2729#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2728#L10-2 assume !!(main_~i~0 < 100); 2720#L10 [2018-11-23 13:15:51,568 INFO L796 eck$LassoCheckResult]: Loop: 2720#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2721#L10-2 assume !!(main_~i~0 < 100); 2729#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2728#L10-2 assume !!(main_~i~0 < 100); 2720#L10 [2018-11-23 13:15:51,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:51,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2091478348, now seen corresponding path program 18 times [2018-11-23 13:15:51,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:51,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:51,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:51,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:51,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 16 times [2018-11-23 13:15:51,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:51,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:51,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:51,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:51,582 INFO L82 PathProgramCache]: Analyzing trace with hash -72543892, now seen corresponding path program 18 times [2018-11-23 13:15:51,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:51,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:51,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:51,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 57 proven. 342 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:51,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:51,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:51,718 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:15:51,730 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-11-23 13:15:51,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:51,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 57 proven. 342 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:51,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:51,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-11-23 13:15:51,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:15:51,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:15:51,769 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. cyclomatic complexity: 3 Second operand 21 states. [2018-11-23 13:15:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:51,799 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 13:15:51,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:15:51,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 47 transitions. [2018-11-23 13:15:51,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:51,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 44 states and 46 transitions. [2018-11-23 13:15:51,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:51,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:51,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 46 transitions. [2018-11-23 13:15:51,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:51,801 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-23 13:15:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 46 transitions. [2018-11-23 13:15:51,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 13:15:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:15:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-23 13:15:51,803 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-23 13:15:51,803 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-23 13:15:51,803 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-23 13:15:51,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 45 transitions. [2018-11-23 13:15:51,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:51,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:51,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:51,804 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [20, 19, 1] [2018-11-23 13:15:51,804 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:51,805 INFO L794 eck$LassoCheckResult]: Stem: 2959#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 2960#L10-2 assume !!(main_~i~0 < 100); 2961#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2962#L10-2 assume !!(main_~i~0 < 100); 2957#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2958#L10-2 assume !!(main_~i~0 < 100); 2997#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2996#L10-2 assume !!(main_~i~0 < 100); 2995#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2994#L10-2 assume !!(main_~i~0 < 100); 2993#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2992#L10-2 assume !!(main_~i~0 < 100); 2991#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2990#L10-2 assume !!(main_~i~0 < 100); 2989#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2988#L10-2 assume !!(main_~i~0 < 100); 2987#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2986#L10-2 assume !!(main_~i~0 < 100); 2985#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2984#L10-2 assume !!(main_~i~0 < 100); 2983#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2982#L10-2 assume !!(main_~i~0 < 100); 2981#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2980#L10-2 assume !!(main_~i~0 < 100); 2979#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2978#L10-2 assume !!(main_~i~0 < 100); 2977#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2976#L10-2 assume !!(main_~i~0 < 100); 2975#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2974#L10-2 assume !!(main_~i~0 < 100); 2973#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2972#L10-2 assume !!(main_~i~0 < 100); 2971#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2970#L10-2 assume !!(main_~i~0 < 100); 2969#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2968#L10-2 assume !!(main_~i~0 < 100); 2966#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2965#L10-2 assume !!(main_~i~0 < 100); 2964#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2963#L10-2 assume !!(main_~i~0 < 100); 2955#L10 [2018-11-23 13:15:51,805 INFO L796 eck$LassoCheckResult]: Loop: 2955#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 2956#L10-2 assume !!(main_~i~0 < 100); 2964#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 2963#L10-2 assume !!(main_~i~0 < 100); 2955#L10 [2018-11-23 13:15:51,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:51,805 INFO L82 PathProgramCache]: Analyzing trace with hash 134002513, now seen corresponding path program 19 times [2018-11-23 13:15:51,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:51,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:51,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:51,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:51,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 17 times [2018-11-23 13:15:51,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:51,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:51,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:51,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:51,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:51,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1052401783, now seen corresponding path program 19 times [2018-11-23 13:15:51,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:51,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:51,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:51,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:51,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:51,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:51,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:51,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:52,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:52,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-11-23 13:15:52,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:15:52,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:15:52,037 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. cyclomatic complexity: 3 Second operand 22 states. [2018-11-23 13:15:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:52,069 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-23 13:15:52,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:15:52,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 49 transitions. [2018-11-23 13:15:52,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:52,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 46 states and 48 transitions. [2018-11-23 13:15:52,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:52,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:52,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 48 transitions. [2018-11-23 13:15:52,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:52,070 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-23 13:15:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 48 transitions. [2018-11-23 13:15:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 13:15:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:15:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-11-23 13:15:52,072 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-23 13:15:52,073 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-23 13:15:52,073 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-23 13:15:52,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 47 transitions. [2018-11-23 13:15:52,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:52,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:52,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:52,074 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [21, 20, 1] [2018-11-23 13:15:52,074 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:52,074 INFO L794 eck$LassoCheckResult]: Stem: 3205#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 3206#L10-2 assume !!(main_~i~0 < 100); 3207#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3208#L10-2 assume !!(main_~i~0 < 100); 3203#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3204#L10-2 assume !!(main_~i~0 < 100); 3245#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3244#L10-2 assume !!(main_~i~0 < 100); 3243#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3242#L10-2 assume !!(main_~i~0 < 100); 3241#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3240#L10-2 assume !!(main_~i~0 < 100); 3239#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3238#L10-2 assume !!(main_~i~0 < 100); 3237#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3236#L10-2 assume !!(main_~i~0 < 100); 3235#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3234#L10-2 assume !!(main_~i~0 < 100); 3233#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3232#L10-2 assume !!(main_~i~0 < 100); 3231#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3230#L10-2 assume !!(main_~i~0 < 100); 3229#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3228#L10-2 assume !!(main_~i~0 < 100); 3227#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3226#L10-2 assume !!(main_~i~0 < 100); 3225#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3224#L10-2 assume !!(main_~i~0 < 100); 3223#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3222#L10-2 assume !!(main_~i~0 < 100); 3221#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3220#L10-2 assume !!(main_~i~0 < 100); 3219#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3218#L10-2 assume !!(main_~i~0 < 100); 3217#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3216#L10-2 assume !!(main_~i~0 < 100); 3215#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3214#L10-2 assume !!(main_~i~0 < 100); 3212#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3211#L10-2 assume !!(main_~i~0 < 100); 3210#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3209#L10-2 assume !!(main_~i~0 < 100); 3201#L10 [2018-11-23 13:15:52,074 INFO L796 eck$LassoCheckResult]: Loop: 3201#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 3202#L10-2 assume !!(main_~i~0 < 100); 3210#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3209#L10-2 assume !!(main_~i~0 < 100); 3201#L10 [2018-11-23 13:15:52,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:52,074 INFO L82 PathProgramCache]: Analyzing trace with hash -72603474, now seen corresponding path program 20 times [2018-11-23 13:15:52,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:52,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:52,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:52,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:52,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 18 times [2018-11-23 13:15:52,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:52,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:52,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:52,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:52,092 INFO L82 PathProgramCache]: Analyzing trace with hash -2097997210, now seen corresponding path program 20 times [2018-11-23 13:15:52,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:52,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:52,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:52,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 63 proven. 420 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:52,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:52,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:52,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:15:52,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:15:52,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:52,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 63 proven. 420 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:52,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:52,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-11-23 13:15:52,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:15:52,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:15:52,289 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. cyclomatic complexity: 3 Second operand 23 states. [2018-11-23 13:15:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:52,322 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-11-23 13:15:52,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:15:52,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 51 transitions. [2018-11-23 13:15:52,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:52,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 50 transitions. [2018-11-23 13:15:52,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:52,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:52,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 50 transitions. [2018-11-23 13:15:52,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:52,324 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-23 13:15:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 50 transitions. [2018-11-23 13:15:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 13:15:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:15:52,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-23 13:15:52,326 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-23 13:15:52,326 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-23 13:15:52,326 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-23 13:15:52,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 49 transitions. [2018-11-23 13:15:52,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:52,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:52,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:52,327 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [22, 21, 1] [2018-11-23 13:15:52,327 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:52,328 INFO L794 eck$LassoCheckResult]: Stem: 3462#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 3463#L10-2 assume !!(main_~i~0 < 100); 3464#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3465#L10-2 assume !!(main_~i~0 < 100); 3460#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3461#L10-2 assume !!(main_~i~0 < 100); 3504#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3503#L10-2 assume !!(main_~i~0 < 100); 3502#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3501#L10-2 assume !!(main_~i~0 < 100); 3500#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3499#L10-2 assume !!(main_~i~0 < 100); 3498#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3497#L10-2 assume !!(main_~i~0 < 100); 3496#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3495#L10-2 assume !!(main_~i~0 < 100); 3494#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3493#L10-2 assume !!(main_~i~0 < 100); 3492#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3491#L10-2 assume !!(main_~i~0 < 100); 3490#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3489#L10-2 assume !!(main_~i~0 < 100); 3488#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3487#L10-2 assume !!(main_~i~0 < 100); 3486#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3485#L10-2 assume !!(main_~i~0 < 100); 3484#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3483#L10-2 assume !!(main_~i~0 < 100); 3482#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3481#L10-2 assume !!(main_~i~0 < 100); 3480#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3479#L10-2 assume !!(main_~i~0 < 100); 3478#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3477#L10-2 assume !!(main_~i~0 < 100); 3476#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3475#L10-2 assume !!(main_~i~0 < 100); 3474#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3473#L10-2 assume !!(main_~i~0 < 100); 3472#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3471#L10-2 assume !!(main_~i~0 < 100); 3469#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3468#L10-2 assume !!(main_~i~0 < 100); 3467#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3466#L10-2 assume !!(main_~i~0 < 100); 3458#L10 [2018-11-23 13:15:52,328 INFO L796 eck$LassoCheckResult]: Loop: 3458#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 3459#L10-2 assume !!(main_~i~0 < 100); 3467#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3466#L10-2 assume !!(main_~i~0 < 100); 3458#L10 [2018-11-23 13:15:52,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:52,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1052461365, now seen corresponding path program 21 times [2018-11-23 13:15:52,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:52,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:52,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:52,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:52,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 19 times [2018-11-23 13:15:52,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:52,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:52,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:52,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:52,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1892855293, now seen corresponding path program 21 times [2018-11-23 13:15:52,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:52,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:52,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:52,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 66 proven. 462 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:52,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:52,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:52,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:15:52,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-23 13:15:52,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:52,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 66 proven. 462 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:52,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:52,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-11-23 13:15:52,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 13:15:52,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:15:52,615 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. cyclomatic complexity: 3 Second operand 24 states. [2018-11-23 13:15:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:52,651 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-23 13:15:52,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:15:52,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 53 transitions. [2018-11-23 13:15:52,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:52,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 50 states and 52 transitions. [2018-11-23 13:15:52,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:52,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:52,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 52 transitions. [2018-11-23 13:15:52,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:52,653 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-11-23 13:15:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 52 transitions. [2018-11-23 13:15:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 13:15:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:15:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-11-23 13:15:52,655 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-11-23 13:15:52,655 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-11-23 13:15:52,655 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-23 13:15:52,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 51 transitions. [2018-11-23 13:15:52,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:52,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:52,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:52,656 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 22, 1] [2018-11-23 13:15:52,656 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:52,656 INFO L794 eck$LassoCheckResult]: Stem: 3730#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 3731#L10-2 assume !!(main_~i~0 < 100); 3732#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3733#L10-2 assume !!(main_~i~0 < 100); 3728#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3729#L10-2 assume !!(main_~i~0 < 100); 3774#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3773#L10-2 assume !!(main_~i~0 < 100); 3772#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3771#L10-2 assume !!(main_~i~0 < 100); 3770#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3769#L10-2 assume !!(main_~i~0 < 100); 3768#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3767#L10-2 assume !!(main_~i~0 < 100); 3766#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3765#L10-2 assume !!(main_~i~0 < 100); 3764#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3763#L10-2 assume !!(main_~i~0 < 100); 3762#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3761#L10-2 assume !!(main_~i~0 < 100); 3760#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3759#L10-2 assume !!(main_~i~0 < 100); 3758#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3757#L10-2 assume !!(main_~i~0 < 100); 3756#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3755#L10-2 assume !!(main_~i~0 < 100); 3754#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3753#L10-2 assume !!(main_~i~0 < 100); 3752#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3751#L10-2 assume !!(main_~i~0 < 100); 3750#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3749#L10-2 assume !!(main_~i~0 < 100); 3748#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3747#L10-2 assume !!(main_~i~0 < 100); 3746#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3745#L10-2 assume !!(main_~i~0 < 100); 3744#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3743#L10-2 assume !!(main_~i~0 < 100); 3742#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3741#L10-2 assume !!(main_~i~0 < 100); 3740#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3739#L10-2 assume !!(main_~i~0 < 100); 3737#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3736#L10-2 assume !!(main_~i~0 < 100); 3735#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3734#L10-2 assume !!(main_~i~0 < 100); 3726#L10 [2018-11-23 13:15:52,656 INFO L796 eck$LassoCheckResult]: Loop: 3726#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 3727#L10-2 assume !!(main_~i~0 < 100); 3735#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 3734#L10-2 assume !!(main_~i~0 < 100); 3726#L10 [2018-11-23 13:15:52,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2098056792, now seen corresponding path program 22 times [2018-11-23 13:15:52,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:52,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:52,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:52,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:52,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 20 times [2018-11-23 13:15:52,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:52,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:52,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:52,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:52,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1974998624, now seen corresponding path program 22 times [2018-11-23 13:15:52,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:52,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:52,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:52,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:52,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:52,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:52,846 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:15:52,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:15:52,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:52,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:52,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:52,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-11-23 13:15:52,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:15:52,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:15:52,896 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. cyclomatic complexity: 3 Second operand 25 states. [2018-11-23 13:15:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:52,936 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-11-23 13:15:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 13:15:52,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 55 transitions. [2018-11-23 13:15:52,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:52,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 52 states and 54 transitions. [2018-11-23 13:15:52,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:52,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:52,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 54 transitions. [2018-11-23 13:15:52,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:52,937 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-11-23 13:15:52,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 54 transitions. [2018-11-23 13:15:52,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 13:15:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:15:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-11-23 13:15:52,938 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-23 13:15:52,938 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-23 13:15:52,938 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-23 13:15:52,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 53 transitions. [2018-11-23 13:15:52,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:52,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:52,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:52,939 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [24, 23, 1] [2018-11-23 13:15:52,939 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:52,940 INFO L794 eck$LassoCheckResult]: Stem: 4009#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 4010#L10-2 assume !!(main_~i~0 < 100); 4011#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4012#L10-2 assume !!(main_~i~0 < 100); 4007#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4008#L10-2 assume !!(main_~i~0 < 100); 4055#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4054#L10-2 assume !!(main_~i~0 < 100); 4053#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4052#L10-2 assume !!(main_~i~0 < 100); 4051#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4050#L10-2 assume !!(main_~i~0 < 100); 4049#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4048#L10-2 assume !!(main_~i~0 < 100); 4047#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4046#L10-2 assume !!(main_~i~0 < 100); 4045#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4044#L10-2 assume !!(main_~i~0 < 100); 4043#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4042#L10-2 assume !!(main_~i~0 < 100); 4041#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4040#L10-2 assume !!(main_~i~0 < 100); 4039#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4038#L10-2 assume !!(main_~i~0 < 100); 4037#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4036#L10-2 assume !!(main_~i~0 < 100); 4035#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4034#L10-2 assume !!(main_~i~0 < 100); 4033#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4032#L10-2 assume !!(main_~i~0 < 100); 4031#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4030#L10-2 assume !!(main_~i~0 < 100); 4029#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4028#L10-2 assume !!(main_~i~0 < 100); 4027#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4026#L10-2 assume !!(main_~i~0 < 100); 4025#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4024#L10-2 assume !!(main_~i~0 < 100); 4023#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4022#L10-2 assume !!(main_~i~0 < 100); 4021#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4020#L10-2 assume !!(main_~i~0 < 100); 4019#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4018#L10-2 assume !!(main_~i~0 < 100); 4016#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4015#L10-2 assume !!(main_~i~0 < 100); 4014#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4013#L10-2 assume !!(main_~i~0 < 100); 4005#L10 [2018-11-23 13:15:52,940 INFO L796 eck$LassoCheckResult]: Loop: 4005#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 4006#L10-2 assume !!(main_~i~0 < 100); 4014#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4013#L10-2 assume !!(main_~i~0 < 100); 4005#L10 [2018-11-23 13:15:52,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:52,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1892914875, now seen corresponding path program 23 times [2018-11-23 13:15:52,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:52,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:52,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 21 times [2018-11-23 13:15:52,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:52,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:52,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:52,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:52,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:52,953 INFO L82 PathProgramCache]: Analyzing trace with hash -459065475, now seen corresponding path program 23 times [2018-11-23 13:15:52,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:52,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:52,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:52,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 72 proven. 552 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:53,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:53,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:53,164 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:15:53,180 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2018-11-23 13:15:53,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:53,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 72 proven. 552 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:53,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:53,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-11-23 13:15:53,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:15:53,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:15:53,214 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. cyclomatic complexity: 3 Second operand 26 states. [2018-11-23 13:15:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:53,248 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-23 13:15:53,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 13:15:53,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 57 transitions. [2018-11-23 13:15:53,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:53,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 56 transitions. [2018-11-23 13:15:53,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:53,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:53,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 56 transitions. [2018-11-23 13:15:53,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:53,250 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-11-23 13:15:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 56 transitions. [2018-11-23 13:15:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 13:15:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:15:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-11-23 13:15:53,251 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-11-23 13:15:53,251 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-11-23 13:15:53,251 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-23 13:15:53,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 55 transitions. [2018-11-23 13:15:53,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:53,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:53,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:53,252 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [25, 24, 1] [2018-11-23 13:15:53,252 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:53,253 INFO L794 eck$LassoCheckResult]: Stem: 4299#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 4300#L10-2 assume !!(main_~i~0 < 100); 4301#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4302#L10-2 assume !!(main_~i~0 < 100); 4297#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4298#L10-2 assume !!(main_~i~0 < 100); 4347#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4346#L10-2 assume !!(main_~i~0 < 100); 4345#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4344#L10-2 assume !!(main_~i~0 < 100); 4343#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4342#L10-2 assume !!(main_~i~0 < 100); 4341#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4340#L10-2 assume !!(main_~i~0 < 100); 4339#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4338#L10-2 assume !!(main_~i~0 < 100); 4337#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4336#L10-2 assume !!(main_~i~0 < 100); 4335#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4334#L10-2 assume !!(main_~i~0 < 100); 4333#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4332#L10-2 assume !!(main_~i~0 < 100); 4331#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4330#L10-2 assume !!(main_~i~0 < 100); 4329#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4328#L10-2 assume !!(main_~i~0 < 100); 4327#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4326#L10-2 assume !!(main_~i~0 < 100); 4325#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4324#L10-2 assume !!(main_~i~0 < 100); 4323#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4322#L10-2 assume !!(main_~i~0 < 100); 4321#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4320#L10-2 assume !!(main_~i~0 < 100); 4319#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4318#L10-2 assume !!(main_~i~0 < 100); 4317#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4316#L10-2 assume !!(main_~i~0 < 100); 4315#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4314#L10-2 assume !!(main_~i~0 < 100); 4313#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4312#L10-2 assume !!(main_~i~0 < 100); 4311#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4310#L10-2 assume !!(main_~i~0 < 100); 4309#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4308#L10-2 assume !!(main_~i~0 < 100); 4306#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4305#L10-2 assume !!(main_~i~0 < 100); 4304#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4303#L10-2 assume !!(main_~i~0 < 100); 4295#L10 [2018-11-23 13:15:53,253 INFO L796 eck$LassoCheckResult]: Loop: 4295#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 4296#L10-2 assume !!(main_~i~0 < 100); 4304#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4303#L10-2 assume !!(main_~i~0 < 100); 4295#L10 [2018-11-23 13:15:53,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:53,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1974939042, now seen corresponding path program 24 times [2018-11-23 13:15:53,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:53,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:53,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:53,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:53,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:53,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 22 times [2018-11-23 13:15:53,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:53,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:53,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:53,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:53,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:53,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1162511706, now seen corresponding path program 24 times [2018-11-23 13:15:53,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:53,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:53,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:53,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 75 proven. 600 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:53,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:53,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:53,479 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:15:53,498 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-11-23 13:15:53,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:53,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 75 proven. 600 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:53,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:53,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-11-23 13:15:53,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 13:15:53,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:15:53,555 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. cyclomatic complexity: 3 Second operand 27 states. [2018-11-23 13:15:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:53,602 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-23 13:15:53,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 13:15:53,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 59 transitions. [2018-11-23 13:15:53,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:53,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 58 transitions. [2018-11-23 13:15:53,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:53,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:53,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 58 transitions. [2018-11-23 13:15:53,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:53,603 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-23 13:15:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 58 transitions. [2018-11-23 13:15:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-23 13:15:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 13:15:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-23 13:15:53,604 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-23 13:15:53,604 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-23 13:15:53,604 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-23 13:15:53,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 57 transitions. [2018-11-23 13:15:53,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:53,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:53,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:53,605 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [26, 25, 1] [2018-11-23 13:15:53,605 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:53,605 INFO L794 eck$LassoCheckResult]: Stem: 4600#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 4601#L10-2 assume !!(main_~i~0 < 100); 4602#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4603#L10-2 assume !!(main_~i~0 < 100); 4598#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4599#L10-2 assume !!(main_~i~0 < 100); 4650#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4649#L10-2 assume !!(main_~i~0 < 100); 4648#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4647#L10-2 assume !!(main_~i~0 < 100); 4646#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4645#L10-2 assume !!(main_~i~0 < 100); 4644#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4643#L10-2 assume !!(main_~i~0 < 100); 4642#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4641#L10-2 assume !!(main_~i~0 < 100); 4640#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4639#L10-2 assume !!(main_~i~0 < 100); 4638#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4637#L10-2 assume !!(main_~i~0 < 100); 4636#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4635#L10-2 assume !!(main_~i~0 < 100); 4634#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4633#L10-2 assume !!(main_~i~0 < 100); 4632#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4631#L10-2 assume !!(main_~i~0 < 100); 4630#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4629#L10-2 assume !!(main_~i~0 < 100); 4628#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4627#L10-2 assume !!(main_~i~0 < 100); 4626#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4625#L10-2 assume !!(main_~i~0 < 100); 4624#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4623#L10-2 assume !!(main_~i~0 < 100); 4622#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4621#L10-2 assume !!(main_~i~0 < 100); 4620#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4619#L10-2 assume !!(main_~i~0 < 100); 4618#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4617#L10-2 assume !!(main_~i~0 < 100); 4616#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4615#L10-2 assume !!(main_~i~0 < 100); 4614#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4613#L10-2 assume !!(main_~i~0 < 100); 4612#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4611#L10-2 assume !!(main_~i~0 < 100); 4610#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4609#L10-2 assume !!(main_~i~0 < 100); 4607#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4606#L10-2 assume !!(main_~i~0 < 100); 4605#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4604#L10-2 assume !!(main_~i~0 < 100); 4596#L10 [2018-11-23 13:15:53,605 INFO L796 eck$LassoCheckResult]: Loop: 4596#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 4597#L10-2 assume !!(main_~i~0 < 100); 4605#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4604#L10-2 assume !!(main_~i~0 < 100); 4596#L10 [2018-11-23 13:15:53,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:53,605 INFO L82 PathProgramCache]: Analyzing trace with hash -459125057, now seen corresponding path program 25 times [2018-11-23 13:15:53,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:53,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:53,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:53,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:53,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:53,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 23 times [2018-11-23 13:15:53,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:53,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:53,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:53,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:53,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:53,615 INFO L82 PathProgramCache]: Analyzing trace with hash 425054199, now seen corresponding path program 25 times [2018-11-23 13:15:53,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:53,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:53,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:53,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 78 proven. 650 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:53,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:53,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:53,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:53,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 78 proven. 650 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:53,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:53,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-11-23 13:15:53,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 13:15:53,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:15:53,905 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. cyclomatic complexity: 3 Second operand 28 states. [2018-11-23 13:15:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:53,953 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-23 13:15:53,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 13:15:53,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 61 transitions. [2018-11-23 13:15:53,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:53,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 58 states and 60 transitions. [2018-11-23 13:15:53,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:53,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:53,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 60 transitions. [2018-11-23 13:15:53,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:53,955 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-23 13:15:53,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 60 transitions. [2018-11-23 13:15:53,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 13:15:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:15:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-11-23 13:15:53,957 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-23 13:15:53,957 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-23 13:15:53,957 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-23 13:15:53,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 59 transitions. [2018-11-23 13:15:53,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:53,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:53,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:53,958 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [27, 26, 1] [2018-11-23 13:15:53,958 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:53,958 INFO L794 eck$LassoCheckResult]: Stem: 4912#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 4913#L10-2 assume !!(main_~i~0 < 100); 4914#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4915#L10-2 assume !!(main_~i~0 < 100); 4910#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4911#L10-2 assume !!(main_~i~0 < 100); 4964#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4963#L10-2 assume !!(main_~i~0 < 100); 4962#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4961#L10-2 assume !!(main_~i~0 < 100); 4960#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4959#L10-2 assume !!(main_~i~0 < 100); 4958#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4957#L10-2 assume !!(main_~i~0 < 100); 4956#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4955#L10-2 assume !!(main_~i~0 < 100); 4954#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4953#L10-2 assume !!(main_~i~0 < 100); 4952#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4951#L10-2 assume !!(main_~i~0 < 100); 4950#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4949#L10-2 assume !!(main_~i~0 < 100); 4948#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4947#L10-2 assume !!(main_~i~0 < 100); 4946#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4945#L10-2 assume !!(main_~i~0 < 100); 4944#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4943#L10-2 assume !!(main_~i~0 < 100); 4942#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4941#L10-2 assume !!(main_~i~0 < 100); 4940#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4939#L10-2 assume !!(main_~i~0 < 100); 4938#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4937#L10-2 assume !!(main_~i~0 < 100); 4936#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4935#L10-2 assume !!(main_~i~0 < 100); 4934#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4933#L10-2 assume !!(main_~i~0 < 100); 4932#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4931#L10-2 assume !!(main_~i~0 < 100); 4930#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4929#L10-2 assume !!(main_~i~0 < 100); 4928#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4927#L10-2 assume !!(main_~i~0 < 100); 4926#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4925#L10-2 assume !!(main_~i~0 < 100); 4924#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4923#L10-2 assume !!(main_~i~0 < 100); 4922#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4921#L10-2 assume !!(main_~i~0 < 100); 4919#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4918#L10-2 assume !!(main_~i~0 < 100); 4917#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4916#L10-2 assume !!(main_~i~0 < 100); 4908#L10 [2018-11-23 13:15:53,958 INFO L796 eck$LassoCheckResult]: Loop: 4908#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 4909#L10-2 assume !!(main_~i~0 < 100); 4917#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 4916#L10-2 assume !!(main_~i~0 < 100); 4908#L10 [2018-11-23 13:15:53,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:53,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1162452124, now seen corresponding path program 26 times [2018-11-23 13:15:53,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:53,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:53,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:53,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 24 times [2018-11-23 13:15:53,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:53,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:53,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:53,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:53,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:53,971 INFO L82 PathProgramCache]: Analyzing trace with hash 397993812, now seen corresponding path program 26 times [2018-11-23 13:15:53,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:53,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:53,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:53,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 81 proven. 702 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:54,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:54,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:54,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:15:54,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:15:54,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:54,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 81 proven. 702 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:54,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:54,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-11-23 13:15:54,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:15:54,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:15:54,224 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. cyclomatic complexity: 3 Second operand 29 states. [2018-11-23 13:15:54,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:54,257 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-23 13:15:54,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 13:15:54,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 63 transitions. [2018-11-23 13:15:54,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:54,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 60 states and 62 transitions. [2018-11-23 13:15:54,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:54,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:54,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 62 transitions. [2018-11-23 13:15:54,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:54,259 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-23 13:15:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 62 transitions. [2018-11-23 13:15:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-23 13:15:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:15:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-23 13:15:54,260 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-23 13:15:54,260 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-23 13:15:54,260 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-23 13:15:54,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 61 transitions. [2018-11-23 13:15:54,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:54,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:54,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:54,261 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [28, 27, 1] [2018-11-23 13:15:54,261 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:54,261 INFO L794 eck$LassoCheckResult]: Stem: 5235#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 5236#L10-2 assume !!(main_~i~0 < 100); 5237#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5238#L10-2 assume !!(main_~i~0 < 100); 5233#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5234#L10-2 assume !!(main_~i~0 < 100); 5289#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5288#L10-2 assume !!(main_~i~0 < 100); 5287#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5286#L10-2 assume !!(main_~i~0 < 100); 5285#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5284#L10-2 assume !!(main_~i~0 < 100); 5283#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5282#L10-2 assume !!(main_~i~0 < 100); 5281#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5280#L10-2 assume !!(main_~i~0 < 100); 5279#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5278#L10-2 assume !!(main_~i~0 < 100); 5277#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5276#L10-2 assume !!(main_~i~0 < 100); 5275#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5274#L10-2 assume !!(main_~i~0 < 100); 5273#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5272#L10-2 assume !!(main_~i~0 < 100); 5271#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5270#L10-2 assume !!(main_~i~0 < 100); 5269#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5268#L10-2 assume !!(main_~i~0 < 100); 5267#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5266#L10-2 assume !!(main_~i~0 < 100); 5265#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5264#L10-2 assume !!(main_~i~0 < 100); 5263#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5262#L10-2 assume !!(main_~i~0 < 100); 5261#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5260#L10-2 assume !!(main_~i~0 < 100); 5259#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5258#L10-2 assume !!(main_~i~0 < 100); 5257#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5256#L10-2 assume !!(main_~i~0 < 100); 5255#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5254#L10-2 assume !!(main_~i~0 < 100); 5253#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5252#L10-2 assume !!(main_~i~0 < 100); 5251#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5250#L10-2 assume !!(main_~i~0 < 100); 5249#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5248#L10-2 assume !!(main_~i~0 < 100); 5247#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5246#L10-2 assume !!(main_~i~0 < 100); 5245#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5244#L10-2 assume !!(main_~i~0 < 100); 5242#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5241#L10-2 assume !!(main_~i~0 < 100); 5240#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5239#L10-2 assume !!(main_~i~0 < 100); 5231#L10 [2018-11-23 13:15:54,261 INFO L796 eck$LassoCheckResult]: Loop: 5231#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 5232#L10-2 assume !!(main_~i~0 < 100); 5240#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5239#L10-2 assume !!(main_~i~0 < 100); 5231#L10 [2018-11-23 13:15:54,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:54,262 INFO L82 PathProgramCache]: Analyzing trace with hash 424994617, now seen corresponding path program 27 times [2018-11-23 13:15:54,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:54,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:54,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:54,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:54,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:54,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:54,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 25 times [2018-11-23 13:15:54,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:54,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:54,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:54,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:54,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:54,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:54,275 INFO L82 PathProgramCache]: Analyzing trace with hash 162765681, now seen corresponding path program 27 times [2018-11-23 13:15:54,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:54,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:54,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:54,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:54,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 84 proven. 756 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:54,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:54,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:54,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:15:54,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-23 13:15:54,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:54,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 84 proven. 756 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:54,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:54,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-11-23 13:15:54,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 13:15:54,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:15:54,632 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. cyclomatic complexity: 3 Second operand 30 states. [2018-11-23 13:15:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:54,678 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-23 13:15:54,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 13:15:54,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2018-11-23 13:15:54,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:54,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 62 states and 64 transitions. [2018-11-23 13:15:54,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:54,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:54,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 64 transitions. [2018-11-23 13:15:54,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:54,680 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-23 13:15:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 64 transitions. [2018-11-23 13:15:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-23 13:15:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 13:15:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-23 13:15:54,681 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-23 13:15:54,681 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-23 13:15:54,681 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-11-23 13:15:54,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 63 transitions. [2018-11-23 13:15:54,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:54,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:54,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:54,682 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [29, 28, 1] [2018-11-23 13:15:54,682 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:54,682 INFO L794 eck$LassoCheckResult]: Stem: 5569#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 5570#L10-2 assume !!(main_~i~0 < 100); 5571#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5572#L10-2 assume !!(main_~i~0 < 100); 5567#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5568#L10-2 assume !!(main_~i~0 < 100); 5625#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5624#L10-2 assume !!(main_~i~0 < 100); 5623#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5622#L10-2 assume !!(main_~i~0 < 100); 5621#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5620#L10-2 assume !!(main_~i~0 < 100); 5619#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5618#L10-2 assume !!(main_~i~0 < 100); 5617#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5616#L10-2 assume !!(main_~i~0 < 100); 5615#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5614#L10-2 assume !!(main_~i~0 < 100); 5613#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5612#L10-2 assume !!(main_~i~0 < 100); 5611#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5610#L10-2 assume !!(main_~i~0 < 100); 5609#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5608#L10-2 assume !!(main_~i~0 < 100); 5607#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5606#L10-2 assume !!(main_~i~0 < 100); 5605#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5604#L10-2 assume !!(main_~i~0 < 100); 5603#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5602#L10-2 assume !!(main_~i~0 < 100); 5601#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5600#L10-2 assume !!(main_~i~0 < 100); 5599#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5598#L10-2 assume !!(main_~i~0 < 100); 5597#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5596#L10-2 assume !!(main_~i~0 < 100); 5595#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5594#L10-2 assume !!(main_~i~0 < 100); 5593#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5592#L10-2 assume !!(main_~i~0 < 100); 5591#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5590#L10-2 assume !!(main_~i~0 < 100); 5589#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5588#L10-2 assume !!(main_~i~0 < 100); 5587#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5586#L10-2 assume !!(main_~i~0 < 100); 5585#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5584#L10-2 assume !!(main_~i~0 < 100); 5583#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5582#L10-2 assume !!(main_~i~0 < 100); 5581#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5580#L10-2 assume !!(main_~i~0 < 100); 5579#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5578#L10-2 assume !!(main_~i~0 < 100); 5576#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5575#L10-2 assume !!(main_~i~0 < 100); 5574#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5573#L10-2 assume !!(main_~i~0 < 100); 5565#L10 [2018-11-23 13:15:54,682 INFO L796 eck$LassoCheckResult]: Loop: 5565#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 5566#L10-2 assume !!(main_~i~0 < 100); 5574#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5573#L10-2 assume !!(main_~i~0 < 100); 5565#L10 [2018-11-23 13:15:54,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:54,683 INFO L82 PathProgramCache]: Analyzing trace with hash 397934230, now seen corresponding path program 28 times [2018-11-23 13:15:54,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:54,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:54,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:54,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:54,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:54,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:54,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 26 times [2018-11-23 13:15:54,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:54,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:54,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:54,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:54,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:54,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:54,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1741798478, now seen corresponding path program 28 times [2018-11-23 13:15:54,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:54,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:54,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 87 proven. 812 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:54,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:54,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:54,971 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:15:54,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:15:54,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:54,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 87 proven. 812 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:55,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:55,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-11-23 13:15:55,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 13:15:55,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:15:55,015 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. cyclomatic complexity: 3 Second operand 31 states. [2018-11-23 13:15:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:55,071 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-23 13:15:55,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 13:15:55,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 67 transitions. [2018-11-23 13:15:55,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:55,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 66 transitions. [2018-11-23 13:15:55,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:55,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:55,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 66 transitions. [2018-11-23 13:15:55,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:55,075 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-11-23 13:15:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 66 transitions. [2018-11-23 13:15:55,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-23 13:15:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 13:15:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-23 13:15:55,076 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-23 13:15:55,076 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-23 13:15:55,076 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-11-23 13:15:55,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 65 transitions. [2018-11-23 13:15:55,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:55,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:55,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:55,077 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [30, 29, 1] [2018-11-23 13:15:55,077 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:55,077 INFO L794 eck$LassoCheckResult]: Stem: 5914#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 5915#L10-2 assume !!(main_~i~0 < 100); 5916#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5917#L10-2 assume !!(main_~i~0 < 100); 5912#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5913#L10-2 assume !!(main_~i~0 < 100); 5972#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5971#L10-2 assume !!(main_~i~0 < 100); 5970#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5969#L10-2 assume !!(main_~i~0 < 100); 5968#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5967#L10-2 assume !!(main_~i~0 < 100); 5966#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5965#L10-2 assume !!(main_~i~0 < 100); 5964#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5963#L10-2 assume !!(main_~i~0 < 100); 5962#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5961#L10-2 assume !!(main_~i~0 < 100); 5960#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5959#L10-2 assume !!(main_~i~0 < 100); 5958#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5957#L10-2 assume !!(main_~i~0 < 100); 5956#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5955#L10-2 assume !!(main_~i~0 < 100); 5954#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5953#L10-2 assume !!(main_~i~0 < 100); 5952#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5951#L10-2 assume !!(main_~i~0 < 100); 5950#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5949#L10-2 assume !!(main_~i~0 < 100); 5948#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5947#L10-2 assume !!(main_~i~0 < 100); 5946#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5945#L10-2 assume !!(main_~i~0 < 100); 5944#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5943#L10-2 assume !!(main_~i~0 < 100); 5942#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5941#L10-2 assume !!(main_~i~0 < 100); 5940#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5939#L10-2 assume !!(main_~i~0 < 100); 5938#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5937#L10-2 assume !!(main_~i~0 < 100); 5936#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5935#L10-2 assume !!(main_~i~0 < 100); 5934#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5933#L10-2 assume !!(main_~i~0 < 100); 5932#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5931#L10-2 assume !!(main_~i~0 < 100); 5930#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5929#L10-2 assume !!(main_~i~0 < 100); 5928#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5927#L10-2 assume !!(main_~i~0 < 100); 5926#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5925#L10-2 assume !!(main_~i~0 < 100); 5924#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5923#L10-2 assume !!(main_~i~0 < 100); 5921#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5920#L10-2 assume !!(main_~i~0 < 100); 5919#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5918#L10-2 assume !!(main_~i~0 < 100); 5910#L10 [2018-11-23 13:15:55,077 INFO L796 eck$LassoCheckResult]: Loop: 5910#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 5911#L10-2 assume !!(main_~i~0 < 100); 5919#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 5918#L10-2 assume !!(main_~i~0 < 100); 5910#L10 [2018-11-23 13:15:55,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:55,077 INFO L82 PathProgramCache]: Analyzing trace with hash 162706099, now seen corresponding path program 29 times [2018-11-23 13:15:55,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:55,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:55,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:55,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:55,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:55,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 27 times [2018-11-23 13:15:55,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:55,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:55,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:55,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:55,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:55,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1226106389, now seen corresponding path program 29 times [2018-11-23 13:15:55,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:55,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:55,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:55,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 90 proven. 870 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:55,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:55,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:55,426 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:15:55,447 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2018-11-23 13:15:55,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:55,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 90 proven. 870 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:55,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:55,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-11-23 13:15:55,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 13:15:55,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:15:55,484 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. cyclomatic complexity: 3 Second operand 32 states. [2018-11-23 13:15:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:55,528 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 13:15:55,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 13:15:55,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 69 transitions. [2018-11-23 13:15:55,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:55,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 66 states and 68 transitions. [2018-11-23 13:15:55,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:55,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:55,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 68 transitions. [2018-11-23 13:15:55,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:55,529 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-23 13:15:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 68 transitions. [2018-11-23 13:15:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-23 13:15:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 13:15:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-11-23 13:15:55,530 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-11-23 13:15:55,530 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-11-23 13:15:55,530 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2018-11-23 13:15:55,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 67 transitions. [2018-11-23 13:15:55,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:55,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:55,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:55,530 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [31, 30, 1] [2018-11-23 13:15:55,531 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:55,531 INFO L794 eck$LassoCheckResult]: Stem: 6270#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 6271#L10-2 assume !!(main_~i~0 < 100); 6272#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6273#L10-2 assume !!(main_~i~0 < 100); 6268#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6269#L10-2 assume !!(main_~i~0 < 100); 6330#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6329#L10-2 assume !!(main_~i~0 < 100); 6328#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6327#L10-2 assume !!(main_~i~0 < 100); 6326#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6325#L10-2 assume !!(main_~i~0 < 100); 6324#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6323#L10-2 assume !!(main_~i~0 < 100); 6322#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6321#L10-2 assume !!(main_~i~0 < 100); 6320#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6319#L10-2 assume !!(main_~i~0 < 100); 6318#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6317#L10-2 assume !!(main_~i~0 < 100); 6316#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6315#L10-2 assume !!(main_~i~0 < 100); 6314#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6313#L10-2 assume !!(main_~i~0 < 100); 6312#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6311#L10-2 assume !!(main_~i~0 < 100); 6310#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6309#L10-2 assume !!(main_~i~0 < 100); 6308#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6307#L10-2 assume !!(main_~i~0 < 100); 6306#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6305#L10-2 assume !!(main_~i~0 < 100); 6304#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6303#L10-2 assume !!(main_~i~0 < 100); 6302#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6301#L10-2 assume !!(main_~i~0 < 100); 6300#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6299#L10-2 assume !!(main_~i~0 < 100); 6298#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6297#L10-2 assume !!(main_~i~0 < 100); 6296#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6295#L10-2 assume !!(main_~i~0 < 100); 6294#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6293#L10-2 assume !!(main_~i~0 < 100); 6292#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6291#L10-2 assume !!(main_~i~0 < 100); 6290#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6289#L10-2 assume !!(main_~i~0 < 100); 6288#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6287#L10-2 assume !!(main_~i~0 < 100); 6286#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6285#L10-2 assume !!(main_~i~0 < 100); 6284#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6283#L10-2 assume !!(main_~i~0 < 100); 6282#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6281#L10-2 assume !!(main_~i~0 < 100); 6280#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6279#L10-2 assume !!(main_~i~0 < 100); 6277#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6276#L10-2 assume !!(main_~i~0 < 100); 6275#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6274#L10-2 assume !!(main_~i~0 < 100); 6266#L10 [2018-11-23 13:15:55,531 INFO L796 eck$LassoCheckResult]: Loop: 6266#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 6267#L10-2 assume !!(main_~i~0 < 100); 6275#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6274#L10-2 assume !!(main_~i~0 < 100); 6266#L10 [2018-11-23 13:15:55,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:55,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1741738896, now seen corresponding path program 30 times [2018-11-23 13:15:55,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:55,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:55,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:55,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:55,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:55,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 28 times [2018-11-23 13:15:55,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:55,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:55,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:55,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:55,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:55,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1524399032, now seen corresponding path program 30 times [2018-11-23 13:15:55,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:55,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:55,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:55,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:55,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:55,834 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:15:55,850 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2018-11-23 13:15:55,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:55,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:55,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:55,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-11-23 13:15:55,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 13:15:55,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:15:55,884 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. cyclomatic complexity: 3 Second operand 33 states. [2018-11-23 13:15:55,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:55,939 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-11-23 13:15:55,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 13:15:55,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 71 transitions. [2018-11-23 13:15:55,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:55,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 68 states and 70 transitions. [2018-11-23 13:15:55,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:55,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:55,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 70 transitions. [2018-11-23 13:15:55,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:55,940 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-23 13:15:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 70 transitions. [2018-11-23 13:15:55,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-11-23 13:15:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:15:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-23 13:15:55,941 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-23 13:15:55,941 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-23 13:15:55,941 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2018-11-23 13:15:55,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 69 transitions. [2018-11-23 13:15:55,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:55,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:55,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:55,941 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [32, 31, 1] [2018-11-23 13:15:55,942 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:55,942 INFO L794 eck$LassoCheckResult]: Stem: 6637#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 6638#L10-2 assume !!(main_~i~0 < 100); 6639#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6640#L10-2 assume !!(main_~i~0 < 100); 6635#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6636#L10-2 assume !!(main_~i~0 < 100); 6699#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6698#L10-2 assume !!(main_~i~0 < 100); 6697#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6696#L10-2 assume !!(main_~i~0 < 100); 6695#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6694#L10-2 assume !!(main_~i~0 < 100); 6693#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6692#L10-2 assume !!(main_~i~0 < 100); 6691#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6690#L10-2 assume !!(main_~i~0 < 100); 6689#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6688#L10-2 assume !!(main_~i~0 < 100); 6687#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6686#L10-2 assume !!(main_~i~0 < 100); 6685#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6684#L10-2 assume !!(main_~i~0 < 100); 6683#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6682#L10-2 assume !!(main_~i~0 < 100); 6681#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6680#L10-2 assume !!(main_~i~0 < 100); 6679#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6678#L10-2 assume !!(main_~i~0 < 100); 6677#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6676#L10-2 assume !!(main_~i~0 < 100); 6675#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6674#L10-2 assume !!(main_~i~0 < 100); 6673#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6672#L10-2 assume !!(main_~i~0 < 100); 6671#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6670#L10-2 assume !!(main_~i~0 < 100); 6669#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6668#L10-2 assume !!(main_~i~0 < 100); 6667#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6666#L10-2 assume !!(main_~i~0 < 100); 6665#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6664#L10-2 assume !!(main_~i~0 < 100); 6663#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6662#L10-2 assume !!(main_~i~0 < 100); 6661#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6660#L10-2 assume !!(main_~i~0 < 100); 6659#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6658#L10-2 assume !!(main_~i~0 < 100); 6657#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6656#L10-2 assume !!(main_~i~0 < 100); 6655#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6654#L10-2 assume !!(main_~i~0 < 100); 6653#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6652#L10-2 assume !!(main_~i~0 < 100); 6651#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6650#L10-2 assume !!(main_~i~0 < 100); 6649#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6648#L10-2 assume !!(main_~i~0 < 100); 6647#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6646#L10-2 assume !!(main_~i~0 < 100); 6644#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6643#L10-2 assume !!(main_~i~0 < 100); 6642#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6641#L10-2 assume !!(main_~i~0 < 100); 6633#L10 [2018-11-23 13:15:55,942 INFO L796 eck$LassoCheckResult]: Loop: 6633#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 6634#L10-2 assume !!(main_~i~0 < 100); 6642#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 6641#L10-2 assume !!(main_~i~0 < 100); 6633#L10 [2018-11-23 13:15:55,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:55,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1226165971, now seen corresponding path program 31 times [2018-11-23 13:15:55,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:55,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:55,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:55,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:55,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:55,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 29 times [2018-11-23 13:15:55,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:55,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:55,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:55,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:55,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash -420820123, now seen corresponding path program 31 times [2018-11-23 13:15:55,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:55,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 96 proven. 992 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:56,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:56,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:56,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:56,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 96 proven. 992 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:56,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:56,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-11-23 13:15:56,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 13:15:56,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:15:56,280 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. cyclomatic complexity: 3 Second operand 34 states. [2018-11-23 13:15:56,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:56,324 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-23 13:15:56,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 13:15:56,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 73 transitions. [2018-11-23 13:15:56,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:56,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 70 states and 72 transitions. [2018-11-23 13:15:56,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:56,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:56,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 72 transitions. [2018-11-23 13:15:56,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:56,326 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-23 13:15:56,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 72 transitions. [2018-11-23 13:15:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 13:15:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 13:15:56,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-11-23 13:15:56,327 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-11-23 13:15:56,327 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-11-23 13:15:56,327 INFO L442 BuchiCegarLoop]: ======== Iteration 34============ [2018-11-23 13:15:56,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 71 transitions. [2018-11-23 13:15:56,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:56,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:56,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:56,328 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [33, 32, 1] [2018-11-23 13:15:56,328 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:56,328 INFO L794 eck$LassoCheckResult]: Stem: 7015#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 7016#L10-2 assume !!(main_~i~0 < 100); 7017#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7018#L10-2 assume !!(main_~i~0 < 100); 7013#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7014#L10-2 assume !!(main_~i~0 < 100); 7079#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7078#L10-2 assume !!(main_~i~0 < 100); 7077#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7076#L10-2 assume !!(main_~i~0 < 100); 7075#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7074#L10-2 assume !!(main_~i~0 < 100); 7073#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7072#L10-2 assume !!(main_~i~0 < 100); 7071#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7070#L10-2 assume !!(main_~i~0 < 100); 7069#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7068#L10-2 assume !!(main_~i~0 < 100); 7067#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7066#L10-2 assume !!(main_~i~0 < 100); 7065#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7064#L10-2 assume !!(main_~i~0 < 100); 7063#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7062#L10-2 assume !!(main_~i~0 < 100); 7061#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7060#L10-2 assume !!(main_~i~0 < 100); 7059#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7058#L10-2 assume !!(main_~i~0 < 100); 7057#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7056#L10-2 assume !!(main_~i~0 < 100); 7055#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7054#L10-2 assume !!(main_~i~0 < 100); 7053#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7052#L10-2 assume !!(main_~i~0 < 100); 7051#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7050#L10-2 assume !!(main_~i~0 < 100); 7049#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7048#L10-2 assume !!(main_~i~0 < 100); 7047#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7046#L10-2 assume !!(main_~i~0 < 100); 7045#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7044#L10-2 assume !!(main_~i~0 < 100); 7043#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7042#L10-2 assume !!(main_~i~0 < 100); 7041#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7040#L10-2 assume !!(main_~i~0 < 100); 7039#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7038#L10-2 assume !!(main_~i~0 < 100); 7037#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7036#L10-2 assume !!(main_~i~0 < 100); 7035#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7034#L10-2 assume !!(main_~i~0 < 100); 7033#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7032#L10-2 assume !!(main_~i~0 < 100); 7031#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7030#L10-2 assume !!(main_~i~0 < 100); 7029#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7028#L10-2 assume !!(main_~i~0 < 100); 7027#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7026#L10-2 assume !!(main_~i~0 < 100); 7025#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7024#L10-2 assume !!(main_~i~0 < 100); 7022#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7021#L10-2 assume !!(main_~i~0 < 100); 7020#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7019#L10-2 assume !!(main_~i~0 < 100); 7011#L10 [2018-11-23 13:15:56,328 INFO L796 eck$LassoCheckResult]: Loop: 7011#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 7012#L10-2 assume !!(main_~i~0 < 100); 7020#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7019#L10-2 assume !!(main_~i~0 < 100); 7011#L10 [2018-11-23 13:15:56,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:56,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1524458614, now seen corresponding path program 32 times [2018-11-23 13:15:56,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:56,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:56,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:56,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:56,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:56,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:56,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 30 times [2018-11-23 13:15:56,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:56,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:56,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:56,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:56,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:56,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:56,338 INFO L82 PathProgramCache]: Analyzing trace with hash -738410686, now seen corresponding path program 32 times [2018-11-23 13:15:56,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:56,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:56,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:56,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:56,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 99 proven. 1056 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:56,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:56,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:56,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:15:56,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:15:56,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:56,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 99 proven. 1056 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:56,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:56,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-11-23 13:15:56,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 13:15:56,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 13:15:56,698 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. cyclomatic complexity: 3 Second operand 35 states. [2018-11-23 13:15:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:56,748 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-11-23 13:15:56,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 13:15:56,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 75 transitions. [2018-11-23 13:15:56,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:56,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 74 transitions. [2018-11-23 13:15:56,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:56,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:56,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 74 transitions. [2018-11-23 13:15:56,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:56,750 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-11-23 13:15:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 74 transitions. [2018-11-23 13:15:56,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 13:15:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 13:15:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-23 13:15:56,752 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-23 13:15:56,752 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-23 13:15:56,752 INFO L442 BuchiCegarLoop]: ======== Iteration 35============ [2018-11-23 13:15:56,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 73 transitions. [2018-11-23 13:15:56,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:56,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:56,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:56,753 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [34, 33, 1] [2018-11-23 13:15:56,753 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:56,753 INFO L794 eck$LassoCheckResult]: Stem: 7404#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 7405#L10-2 assume !!(main_~i~0 < 100); 7406#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7407#L10-2 assume !!(main_~i~0 < 100); 7402#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7403#L10-2 assume !!(main_~i~0 < 100); 7470#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7469#L10-2 assume !!(main_~i~0 < 100); 7468#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7467#L10-2 assume !!(main_~i~0 < 100); 7466#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7465#L10-2 assume !!(main_~i~0 < 100); 7464#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7463#L10-2 assume !!(main_~i~0 < 100); 7462#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7461#L10-2 assume !!(main_~i~0 < 100); 7460#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7459#L10-2 assume !!(main_~i~0 < 100); 7458#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7457#L10-2 assume !!(main_~i~0 < 100); 7456#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7455#L10-2 assume !!(main_~i~0 < 100); 7454#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7453#L10-2 assume !!(main_~i~0 < 100); 7452#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7451#L10-2 assume !!(main_~i~0 < 100); 7450#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7449#L10-2 assume !!(main_~i~0 < 100); 7448#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7447#L10-2 assume !!(main_~i~0 < 100); 7446#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7445#L10-2 assume !!(main_~i~0 < 100); 7444#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7443#L10-2 assume !!(main_~i~0 < 100); 7442#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7441#L10-2 assume !!(main_~i~0 < 100); 7440#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7439#L10-2 assume !!(main_~i~0 < 100); 7438#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7437#L10-2 assume !!(main_~i~0 < 100); 7436#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7435#L10-2 assume !!(main_~i~0 < 100); 7434#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7433#L10-2 assume !!(main_~i~0 < 100); 7432#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7431#L10-2 assume !!(main_~i~0 < 100); 7430#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7429#L10-2 assume !!(main_~i~0 < 100); 7428#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7427#L10-2 assume !!(main_~i~0 < 100); 7426#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7425#L10-2 assume !!(main_~i~0 < 100); 7424#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7423#L10-2 assume !!(main_~i~0 < 100); 7422#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7421#L10-2 assume !!(main_~i~0 < 100); 7420#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7419#L10-2 assume !!(main_~i~0 < 100); 7418#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7417#L10-2 assume !!(main_~i~0 < 100); 7416#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7415#L10-2 assume !!(main_~i~0 < 100); 7414#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7413#L10-2 assume !!(main_~i~0 < 100); 7411#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7410#L10-2 assume !!(main_~i~0 < 100); 7409#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7408#L10-2 assume !!(main_~i~0 < 100); 7400#L10 [2018-11-23 13:15:56,753 INFO L796 eck$LassoCheckResult]: Loop: 7400#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 7401#L10-2 assume !!(main_~i~0 < 100); 7409#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7408#L10-2 assume !!(main_~i~0 < 100); 7400#L10 [2018-11-23 13:15:56,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:56,753 INFO L82 PathProgramCache]: Analyzing trace with hash -420879705, now seen corresponding path program 33 times [2018-11-23 13:15:56,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:56,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:56,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:56,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:56,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:56,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:56,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 31 times [2018-11-23 13:15:56,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:56,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:56,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:56,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:56,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:56,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:56,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1000263713, now seen corresponding path program 33 times [2018-11-23 13:15:56,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:56,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:56,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:56,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:56,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 102 proven. 1122 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:57,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:57,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:57,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:15:57,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-23 13:15:57,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:57,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 102 proven. 1122 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:57,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:57,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-11-23 13:15:57,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 13:15:57,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 13:15:57,148 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. cyclomatic complexity: 3 Second operand 36 states. [2018-11-23 13:15:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:57,192 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-23 13:15:57,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 13:15:57,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 77 transitions. [2018-11-23 13:15:57,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:57,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 74 states and 76 transitions. [2018-11-23 13:15:57,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:57,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:57,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 76 transitions. [2018-11-23 13:15:57,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:57,194 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-11-23 13:15:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 76 transitions. [2018-11-23 13:15:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-23 13:15:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 13:15:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-11-23 13:15:57,195 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-11-23 13:15:57,195 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-11-23 13:15:57,195 INFO L442 BuchiCegarLoop]: ======== Iteration 36============ [2018-11-23 13:15:57,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 75 transitions. [2018-11-23 13:15:57,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:57,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:57,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:57,196 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [35, 34, 1] [2018-11-23 13:15:57,196 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:57,196 INFO L794 eck$LassoCheckResult]: Stem: 7804#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 7805#L10-2 assume !!(main_~i~0 < 100); 7806#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7807#L10-2 assume !!(main_~i~0 < 100); 7802#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7803#L10-2 assume !!(main_~i~0 < 100); 7872#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7871#L10-2 assume !!(main_~i~0 < 100); 7870#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7869#L10-2 assume !!(main_~i~0 < 100); 7868#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7867#L10-2 assume !!(main_~i~0 < 100); 7866#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7865#L10-2 assume !!(main_~i~0 < 100); 7864#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7863#L10-2 assume !!(main_~i~0 < 100); 7862#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7861#L10-2 assume !!(main_~i~0 < 100); 7860#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7859#L10-2 assume !!(main_~i~0 < 100); 7858#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7857#L10-2 assume !!(main_~i~0 < 100); 7856#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7855#L10-2 assume !!(main_~i~0 < 100); 7854#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7853#L10-2 assume !!(main_~i~0 < 100); 7852#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7851#L10-2 assume !!(main_~i~0 < 100); 7850#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7849#L10-2 assume !!(main_~i~0 < 100); 7848#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7847#L10-2 assume !!(main_~i~0 < 100); 7846#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7845#L10-2 assume !!(main_~i~0 < 100); 7844#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7843#L10-2 assume !!(main_~i~0 < 100); 7842#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7841#L10-2 assume !!(main_~i~0 < 100); 7840#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7839#L10-2 assume !!(main_~i~0 < 100); 7838#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7837#L10-2 assume !!(main_~i~0 < 100); 7836#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7835#L10-2 assume !!(main_~i~0 < 100); 7834#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7833#L10-2 assume !!(main_~i~0 < 100); 7832#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7831#L10-2 assume !!(main_~i~0 < 100); 7830#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7829#L10-2 assume !!(main_~i~0 < 100); 7828#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7827#L10-2 assume !!(main_~i~0 < 100); 7826#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7825#L10-2 assume !!(main_~i~0 < 100); 7824#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7823#L10-2 assume !!(main_~i~0 < 100); 7822#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7821#L10-2 assume !!(main_~i~0 < 100); 7820#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7819#L10-2 assume !!(main_~i~0 < 100); 7818#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7817#L10-2 assume !!(main_~i~0 < 100); 7816#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7815#L10-2 assume !!(main_~i~0 < 100); 7814#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7813#L10-2 assume !!(main_~i~0 < 100); 7811#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7810#L10-2 assume !!(main_~i~0 < 100); 7809#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7808#L10-2 assume !!(main_~i~0 < 100); 7800#L10 [2018-11-23 13:15:57,197 INFO L796 eck$LassoCheckResult]: Loop: 7800#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 7801#L10-2 assume !!(main_~i~0 < 100); 7809#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 7808#L10-2 assume !!(main_~i~0 < 100); 7800#L10 [2018-11-23 13:15:57,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:57,197 INFO L82 PathProgramCache]: Analyzing trace with hash -738470268, now seen corresponding path program 34 times [2018-11-23 13:15:57,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:57,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:57,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:57,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:57,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:57,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:57,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 32 times [2018-11-23 13:15:57,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:57,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:57,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:57,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:57,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:57,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:57,211 INFO L82 PathProgramCache]: Analyzing trace with hash 762047804, now seen corresponding path program 34 times [2018-11-23 13:15:57,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:57,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:57,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:57,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:57,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 105 proven. 1190 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:57,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:57,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:57,530 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:15:57,541 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:15:57,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:57,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 105 proven. 1190 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:57,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:57,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-11-23 13:15:57,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 13:15:57,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 13:15:57,576 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. cyclomatic complexity: 3 Second operand 37 states. [2018-11-23 13:15:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:57,626 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-23 13:15:57,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 13:15:57,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 79 transitions. [2018-11-23 13:15:57,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:57,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 76 states and 78 transitions. [2018-11-23 13:15:57,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:57,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:57,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 78 transitions. [2018-11-23 13:15:57,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:57,627 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-11-23 13:15:57,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 78 transitions. [2018-11-23 13:15:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-23 13:15:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 13:15:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-11-23 13:15:57,629 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-11-23 13:15:57,629 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-11-23 13:15:57,629 INFO L442 BuchiCegarLoop]: ======== Iteration 37============ [2018-11-23 13:15:57,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 77 transitions. [2018-11-23 13:15:57,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:57,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:57,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:57,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [36, 35, 1] [2018-11-23 13:15:57,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:57,630 INFO L794 eck$LassoCheckResult]: Stem: 8215#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 8216#L10-2 assume !!(main_~i~0 < 100); 8217#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8218#L10-2 assume !!(main_~i~0 < 100); 8213#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8214#L10-2 assume !!(main_~i~0 < 100); 8285#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8284#L10-2 assume !!(main_~i~0 < 100); 8283#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8282#L10-2 assume !!(main_~i~0 < 100); 8281#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8280#L10-2 assume !!(main_~i~0 < 100); 8279#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8278#L10-2 assume !!(main_~i~0 < 100); 8277#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8276#L10-2 assume !!(main_~i~0 < 100); 8275#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8274#L10-2 assume !!(main_~i~0 < 100); 8273#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8272#L10-2 assume !!(main_~i~0 < 100); 8271#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8270#L10-2 assume !!(main_~i~0 < 100); 8269#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8268#L10-2 assume !!(main_~i~0 < 100); 8267#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8266#L10-2 assume !!(main_~i~0 < 100); 8265#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8264#L10-2 assume !!(main_~i~0 < 100); 8263#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8262#L10-2 assume !!(main_~i~0 < 100); 8261#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8260#L10-2 assume !!(main_~i~0 < 100); 8259#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8258#L10-2 assume !!(main_~i~0 < 100); 8257#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8256#L10-2 assume !!(main_~i~0 < 100); 8255#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8254#L10-2 assume !!(main_~i~0 < 100); 8253#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8252#L10-2 assume !!(main_~i~0 < 100); 8251#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8250#L10-2 assume !!(main_~i~0 < 100); 8249#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8248#L10-2 assume !!(main_~i~0 < 100); 8247#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8246#L10-2 assume !!(main_~i~0 < 100); 8245#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8244#L10-2 assume !!(main_~i~0 < 100); 8243#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8242#L10-2 assume !!(main_~i~0 < 100); 8241#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8240#L10-2 assume !!(main_~i~0 < 100); 8239#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8238#L10-2 assume !!(main_~i~0 < 100); 8237#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8236#L10-2 assume !!(main_~i~0 < 100); 8235#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8234#L10-2 assume !!(main_~i~0 < 100); 8233#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8232#L10-2 assume !!(main_~i~0 < 100); 8231#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8230#L10-2 assume !!(main_~i~0 < 100); 8229#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8228#L10-2 assume !!(main_~i~0 < 100); 8227#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8226#L10-2 assume !!(main_~i~0 < 100); 8225#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8224#L10-2 assume !!(main_~i~0 < 100); 8222#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8221#L10-2 assume !!(main_~i~0 < 100); 8220#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8219#L10-2 assume !!(main_~i~0 < 100); 8211#L10 [2018-11-23 13:15:57,630 INFO L796 eck$LassoCheckResult]: Loop: 8211#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 8212#L10-2 assume !!(main_~i~0 < 100); 8220#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8219#L10-2 assume !!(main_~i~0 < 100); 8211#L10 [2018-11-23 13:15:57,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:57,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1000323295, now seen corresponding path program 35 times [2018-11-23 13:15:57,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:57,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:57,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:57,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:57,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:57,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:57,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 33 times [2018-11-23 13:15:57,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:57,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:57,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:57,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:57,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:57,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:57,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2126301017, now seen corresponding path program 35 times [2018-11-23 13:15:57,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:57,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:57,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 108 proven. 1260 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:58,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:58,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:58,012 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:15:58,044 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2018-11-23 13:15:58,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:58,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 108 proven. 1260 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:58,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:58,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-11-23 13:15:58,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 13:15:58,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:15:58,080 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. cyclomatic complexity: 3 Second operand 38 states. [2018-11-23 13:15:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:58,133 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-11-23 13:15:58,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 13:15:58,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 81 transitions. [2018-11-23 13:15:58,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:58,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 78 states and 80 transitions. [2018-11-23 13:15:58,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:58,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:58,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 80 transitions. [2018-11-23 13:15:58,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:58,135 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-11-23 13:15:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 80 transitions. [2018-11-23 13:15:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 13:15:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 13:15:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-11-23 13:15:58,136 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-11-23 13:15:58,136 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-11-23 13:15:58,136 INFO L442 BuchiCegarLoop]: ======== Iteration 38============ [2018-11-23 13:15:58,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 79 transitions. [2018-11-23 13:15:58,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:58,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:58,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:58,137 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [37, 36, 1] [2018-11-23 13:15:58,137 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:58,137 INFO L794 eck$LassoCheckResult]: Stem: 8637#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 8638#L10-2 assume !!(main_~i~0 < 100); 8639#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8640#L10-2 assume !!(main_~i~0 < 100); 8635#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8636#L10-2 assume !!(main_~i~0 < 100); 8709#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8708#L10-2 assume !!(main_~i~0 < 100); 8707#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8706#L10-2 assume !!(main_~i~0 < 100); 8705#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8704#L10-2 assume !!(main_~i~0 < 100); 8703#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8702#L10-2 assume !!(main_~i~0 < 100); 8701#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8700#L10-2 assume !!(main_~i~0 < 100); 8699#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8698#L10-2 assume !!(main_~i~0 < 100); 8697#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8696#L10-2 assume !!(main_~i~0 < 100); 8695#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8694#L10-2 assume !!(main_~i~0 < 100); 8693#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8692#L10-2 assume !!(main_~i~0 < 100); 8691#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8690#L10-2 assume !!(main_~i~0 < 100); 8689#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8688#L10-2 assume !!(main_~i~0 < 100); 8687#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8686#L10-2 assume !!(main_~i~0 < 100); 8685#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8684#L10-2 assume !!(main_~i~0 < 100); 8683#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8682#L10-2 assume !!(main_~i~0 < 100); 8681#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8680#L10-2 assume !!(main_~i~0 < 100); 8679#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8678#L10-2 assume !!(main_~i~0 < 100); 8677#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8676#L10-2 assume !!(main_~i~0 < 100); 8675#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8674#L10-2 assume !!(main_~i~0 < 100); 8673#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8672#L10-2 assume !!(main_~i~0 < 100); 8671#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8670#L10-2 assume !!(main_~i~0 < 100); 8669#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8668#L10-2 assume !!(main_~i~0 < 100); 8667#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8666#L10-2 assume !!(main_~i~0 < 100); 8665#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8664#L10-2 assume !!(main_~i~0 < 100); 8663#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8662#L10-2 assume !!(main_~i~0 < 100); 8661#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8660#L10-2 assume !!(main_~i~0 < 100); 8659#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8658#L10-2 assume !!(main_~i~0 < 100); 8657#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8656#L10-2 assume !!(main_~i~0 < 100); 8655#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8654#L10-2 assume !!(main_~i~0 < 100); 8653#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8652#L10-2 assume !!(main_~i~0 < 100); 8651#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8650#L10-2 assume !!(main_~i~0 < 100); 8649#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8648#L10-2 assume !!(main_~i~0 < 100); 8647#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8646#L10-2 assume !!(main_~i~0 < 100); 8644#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8643#L10-2 assume !!(main_~i~0 < 100); 8642#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8641#L10-2 assume !!(main_~i~0 < 100); 8633#L10 [2018-11-23 13:15:58,137 INFO L796 eck$LassoCheckResult]: Loop: 8633#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 8634#L10-2 assume !!(main_~i~0 < 100); 8642#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 8641#L10-2 assume !!(main_~i~0 < 100); 8633#L10 [2018-11-23 13:15:58,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:58,137 INFO L82 PathProgramCache]: Analyzing trace with hash 761988222, now seen corresponding path program 36 times [2018-11-23 13:15:58,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:58,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:58,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:58,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:58,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:58,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:58,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 34 times [2018-11-23 13:15:58,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:58,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:58,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:58,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:58,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:58,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:58,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1086353866, now seen corresponding path program 36 times [2018-11-23 13:15:58,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:58,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:58,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1332 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:58,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:58,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:58,525 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:15:58,545 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2018-11-23 13:15:58,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:58,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1332 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:58,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:58,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-11-23 13:15:58,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 13:15:58,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 13:15:58,580 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. cyclomatic complexity: 3 Second operand 39 states. [2018-11-23 13:15:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:58,647 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-11-23 13:15:58,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 13:15:58,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 83 transitions. [2018-11-23 13:15:58,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:58,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 82 transitions. [2018-11-23 13:15:58,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:58,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:58,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 82 transitions. [2018-11-23 13:15:58,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:58,648 INFO L705 BuchiCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-11-23 13:15:58,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 82 transitions. [2018-11-23 13:15:58,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-11-23 13:15:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 13:15:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-11-23 13:15:58,649 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-23 13:15:58,649 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-23 13:15:58,649 INFO L442 BuchiCegarLoop]: ======== Iteration 39============ [2018-11-23 13:15:58,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 81 transitions. [2018-11-23 13:15:58,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:58,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:58,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:58,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [38, 37, 1] [2018-11-23 13:15:58,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:58,650 INFO L794 eck$LassoCheckResult]: Stem: 9070#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 9071#L10-2 assume !!(main_~i~0 < 100); 9072#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9073#L10-2 assume !!(main_~i~0 < 100); 9068#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9069#L10-2 assume !!(main_~i~0 < 100); 9144#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9143#L10-2 assume !!(main_~i~0 < 100); 9142#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9141#L10-2 assume !!(main_~i~0 < 100); 9140#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9139#L10-2 assume !!(main_~i~0 < 100); 9138#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9137#L10-2 assume !!(main_~i~0 < 100); 9136#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9135#L10-2 assume !!(main_~i~0 < 100); 9134#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9133#L10-2 assume !!(main_~i~0 < 100); 9132#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9131#L10-2 assume !!(main_~i~0 < 100); 9130#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9129#L10-2 assume !!(main_~i~0 < 100); 9128#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9127#L10-2 assume !!(main_~i~0 < 100); 9126#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9125#L10-2 assume !!(main_~i~0 < 100); 9124#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9123#L10-2 assume !!(main_~i~0 < 100); 9122#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9121#L10-2 assume !!(main_~i~0 < 100); 9120#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9119#L10-2 assume !!(main_~i~0 < 100); 9118#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9117#L10-2 assume !!(main_~i~0 < 100); 9116#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9115#L10-2 assume !!(main_~i~0 < 100); 9114#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9113#L10-2 assume !!(main_~i~0 < 100); 9112#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9111#L10-2 assume !!(main_~i~0 < 100); 9110#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9109#L10-2 assume !!(main_~i~0 < 100); 9108#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9107#L10-2 assume !!(main_~i~0 < 100); 9106#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9105#L10-2 assume !!(main_~i~0 < 100); 9104#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9103#L10-2 assume !!(main_~i~0 < 100); 9102#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9101#L10-2 assume !!(main_~i~0 < 100); 9100#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9099#L10-2 assume !!(main_~i~0 < 100); 9098#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9097#L10-2 assume !!(main_~i~0 < 100); 9096#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9095#L10-2 assume !!(main_~i~0 < 100); 9094#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9093#L10-2 assume !!(main_~i~0 < 100); 9092#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9091#L10-2 assume !!(main_~i~0 < 100); 9090#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9089#L10-2 assume !!(main_~i~0 < 100); 9088#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9087#L10-2 assume !!(main_~i~0 < 100); 9086#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9085#L10-2 assume !!(main_~i~0 < 100); 9084#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9083#L10-2 assume !!(main_~i~0 < 100); 9082#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9081#L10-2 assume !!(main_~i~0 < 100); 9080#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9079#L10-2 assume !!(main_~i~0 < 100); 9077#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9076#L10-2 assume !!(main_~i~0 < 100); 9075#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9074#L10-2 assume !!(main_~i~0 < 100); 9066#L10 [2018-11-23 13:15:58,650 INFO L796 eck$LassoCheckResult]: Loop: 9066#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 9067#L10-2 assume !!(main_~i~0 < 100); 9075#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9074#L10-2 assume !!(main_~i~0 < 100); 9066#L10 [2018-11-23 13:15:58,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:58,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2126241435, now seen corresponding path program 37 times [2018-11-23 13:15:58,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:58,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:58,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:58,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:58,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:58,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:58,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 35 times [2018-11-23 13:15:58,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:58,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:58,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:58,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:58,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:58,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:58,666 INFO L82 PathProgramCache]: Analyzing trace with hash -366210605, now seen corresponding path program 37 times [2018-11-23 13:15:58,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:58,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:58,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:58,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:58,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 114 proven. 1406 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:59,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:59,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:59,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:59,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 114 proven. 1406 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:59,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:59,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-11-23 13:15:59,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 13:15:59,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 13:15:59,093 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. cyclomatic complexity: 3 Second operand 40 states. [2018-11-23 13:15:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:59,161 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-23 13:15:59,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 13:15:59,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 85 transitions. [2018-11-23 13:15:59,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:59,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 82 states and 84 transitions. [2018-11-23 13:15:59,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:59,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:59,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 84 transitions. [2018-11-23 13:15:59,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:59,163 INFO L705 BuchiCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-23 13:15:59,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 84 transitions. [2018-11-23 13:15:59,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-11-23 13:15:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 13:15:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-11-23 13:15:59,164 INFO L728 BuchiCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-11-23 13:15:59,164 INFO L608 BuchiCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-11-23 13:15:59,164 INFO L442 BuchiCegarLoop]: ======== Iteration 40============ [2018-11-23 13:15:59,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 83 transitions. [2018-11-23 13:15:59,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:59,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:59,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:59,165 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [39, 38, 1] [2018-11-23 13:15:59,165 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:59,166 INFO L794 eck$LassoCheckResult]: Stem: 9514#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 9515#L10-2 assume !!(main_~i~0 < 100); 9516#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9517#L10-2 assume !!(main_~i~0 < 100); 9512#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9513#L10-2 assume !!(main_~i~0 < 100); 9590#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9589#L10-2 assume !!(main_~i~0 < 100); 9588#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9587#L10-2 assume !!(main_~i~0 < 100); 9586#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9585#L10-2 assume !!(main_~i~0 < 100); 9584#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9583#L10-2 assume !!(main_~i~0 < 100); 9582#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9581#L10-2 assume !!(main_~i~0 < 100); 9580#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9579#L10-2 assume !!(main_~i~0 < 100); 9578#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9577#L10-2 assume !!(main_~i~0 < 100); 9576#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9575#L10-2 assume !!(main_~i~0 < 100); 9574#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9573#L10-2 assume !!(main_~i~0 < 100); 9572#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9571#L10-2 assume !!(main_~i~0 < 100); 9570#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9569#L10-2 assume !!(main_~i~0 < 100); 9568#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9567#L10-2 assume !!(main_~i~0 < 100); 9566#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9565#L10-2 assume !!(main_~i~0 < 100); 9564#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9563#L10-2 assume !!(main_~i~0 < 100); 9562#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9561#L10-2 assume !!(main_~i~0 < 100); 9560#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9559#L10-2 assume !!(main_~i~0 < 100); 9558#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9557#L10-2 assume !!(main_~i~0 < 100); 9556#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9555#L10-2 assume !!(main_~i~0 < 100); 9554#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9553#L10-2 assume !!(main_~i~0 < 100); 9552#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9551#L10-2 assume !!(main_~i~0 < 100); 9550#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9549#L10-2 assume !!(main_~i~0 < 100); 9548#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9547#L10-2 assume !!(main_~i~0 < 100); 9546#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9545#L10-2 assume !!(main_~i~0 < 100); 9544#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9543#L10-2 assume !!(main_~i~0 < 100); 9542#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9541#L10-2 assume !!(main_~i~0 < 100); 9540#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9539#L10-2 assume !!(main_~i~0 < 100); 9538#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9537#L10-2 assume !!(main_~i~0 < 100); 9536#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9535#L10-2 assume !!(main_~i~0 < 100); 9534#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9533#L10-2 assume !!(main_~i~0 < 100); 9532#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9531#L10-2 assume !!(main_~i~0 < 100); 9530#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9529#L10-2 assume !!(main_~i~0 < 100); 9528#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9527#L10-2 assume !!(main_~i~0 < 100); 9526#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9525#L10-2 assume !!(main_~i~0 < 100); 9524#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9523#L10-2 assume !!(main_~i~0 < 100); 9521#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9520#L10-2 assume !!(main_~i~0 < 100); 9519#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9518#L10-2 assume !!(main_~i~0 < 100); 9510#L10 [2018-11-23 13:15:59,166 INFO L796 eck$LassoCheckResult]: Loop: 9510#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 9511#L10-2 assume !!(main_~i~0 < 100); 9519#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9518#L10-2 assume !!(main_~i~0 < 100); 9510#L10 [2018-11-23 13:15:59,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:59,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1086413448, now seen corresponding path program 38 times [2018-11-23 13:15:59,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:59,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:59,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:59,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:59,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 36 times [2018-11-23 13:15:59,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:59,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:59,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:59,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash 201728560, now seen corresponding path program 38 times [2018-11-23 13:15:59,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:59,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:59,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:59,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:59,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 117 proven. 1482 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:59,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:59,604 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:15:59,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:15:59,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:15:59,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:59,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 117 proven. 1482 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:15:59,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:59,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-11-23 13:15:59,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 13:15:59,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:15:59,662 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. cyclomatic complexity: 3 Second operand 41 states. [2018-11-23 13:15:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:59,717 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-11-23 13:15:59,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 13:15:59,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 87 transitions. [2018-11-23 13:15:59,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:59,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 84 states and 86 transitions. [2018-11-23 13:15:59,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:15:59,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:15:59,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 86 transitions. [2018-11-23 13:15:59,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:15:59,718 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-11-23 13:15:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 86 transitions. [2018-11-23 13:15:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-11-23 13:15:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 13:15:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-23 13:15:59,719 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-23 13:15:59,720 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-23 13:15:59,720 INFO L442 BuchiCegarLoop]: ======== Iteration 41============ [2018-11-23 13:15:59,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 85 transitions. [2018-11-23 13:15:59,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:15:59,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:15:59,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:15:59,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [40, 39, 1] [2018-11-23 13:15:59,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:15:59,721 INFO L794 eck$LassoCheckResult]: Stem: 9969#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 9970#L10-2 assume !!(main_~i~0 < 100); 9971#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9972#L10-2 assume !!(main_~i~0 < 100); 9967#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9968#L10-2 assume !!(main_~i~0 < 100); 10047#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10046#L10-2 assume !!(main_~i~0 < 100); 10045#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10044#L10-2 assume !!(main_~i~0 < 100); 10043#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10042#L10-2 assume !!(main_~i~0 < 100); 10041#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10040#L10-2 assume !!(main_~i~0 < 100); 10039#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10038#L10-2 assume !!(main_~i~0 < 100); 10037#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10036#L10-2 assume !!(main_~i~0 < 100); 10035#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10034#L10-2 assume !!(main_~i~0 < 100); 10033#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10032#L10-2 assume !!(main_~i~0 < 100); 10031#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10030#L10-2 assume !!(main_~i~0 < 100); 10029#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10028#L10-2 assume !!(main_~i~0 < 100); 10027#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10026#L10-2 assume !!(main_~i~0 < 100); 10025#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10024#L10-2 assume !!(main_~i~0 < 100); 10023#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10022#L10-2 assume !!(main_~i~0 < 100); 10021#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10020#L10-2 assume !!(main_~i~0 < 100); 10019#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10018#L10-2 assume !!(main_~i~0 < 100); 10017#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10016#L10-2 assume !!(main_~i~0 < 100); 10015#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10014#L10-2 assume !!(main_~i~0 < 100); 10013#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10012#L10-2 assume !!(main_~i~0 < 100); 10011#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10010#L10-2 assume !!(main_~i~0 < 100); 10009#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10008#L10-2 assume !!(main_~i~0 < 100); 10007#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10006#L10-2 assume !!(main_~i~0 < 100); 10005#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10004#L10-2 assume !!(main_~i~0 < 100); 10003#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10002#L10-2 assume !!(main_~i~0 < 100); 10001#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10000#L10-2 assume !!(main_~i~0 < 100); 9999#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9998#L10-2 assume !!(main_~i~0 < 100); 9997#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9996#L10-2 assume !!(main_~i~0 < 100); 9995#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9994#L10-2 assume !!(main_~i~0 < 100); 9993#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9992#L10-2 assume !!(main_~i~0 < 100); 9991#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9990#L10-2 assume !!(main_~i~0 < 100); 9989#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9988#L10-2 assume !!(main_~i~0 < 100); 9987#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9986#L10-2 assume !!(main_~i~0 < 100); 9985#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9984#L10-2 assume !!(main_~i~0 < 100); 9983#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9982#L10-2 assume !!(main_~i~0 < 100); 9981#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9980#L10-2 assume !!(main_~i~0 < 100); 9979#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9978#L10-2 assume !!(main_~i~0 < 100); 9976#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9975#L10-2 assume !!(main_~i~0 < 100); 9974#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9973#L10-2 assume !!(main_~i~0 < 100); 9965#L10 [2018-11-23 13:15:59,721 INFO L796 eck$LassoCheckResult]: Loop: 9965#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 9966#L10-2 assume !!(main_~i~0 < 100); 9974#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 9973#L10-2 assume !!(main_~i~0 < 100); 9965#L10 [2018-11-23 13:15:59,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:59,721 INFO L82 PathProgramCache]: Analyzing trace with hash -366270187, now seen corresponding path program 39 times [2018-11-23 13:15:59,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:59,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:59,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:59,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:59,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:59,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 37 times [2018-11-23 13:15:59,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:59,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:59,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:59,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:59,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:15:59,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:59,731 INFO L82 PathProgramCache]: Analyzing trace with hash 530419533, now seen corresponding path program 39 times [2018-11-23 13:15:59,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:59,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:59,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:59,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:59,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 120 proven. 1560 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:00,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:00,126 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:00,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:16:00,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-23 13:16:00,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:00,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 120 proven. 1560 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:00,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:00,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-11-23 13:16:00,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 13:16:00,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 13:16:00,204 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. cyclomatic complexity: 3 Second operand 42 states. [2018-11-23 13:16:00,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:00,263 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-23 13:16:00,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 13:16:00,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 89 transitions. [2018-11-23 13:16:00,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:00,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 86 states and 88 transitions. [2018-11-23 13:16:00,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:16:00,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:16:00,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 88 transitions. [2018-11-23 13:16:00,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:16:00,265 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-11-23 13:16:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 88 transitions. [2018-11-23 13:16:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-11-23 13:16:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 13:16:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2018-11-23 13:16:00,265 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-11-23 13:16:00,265 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-11-23 13:16:00,265 INFO L442 BuchiCegarLoop]: ======== Iteration 42============ [2018-11-23 13:16:00,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 87 transitions. [2018-11-23 13:16:00,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:00,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:16:00,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:16:00,266 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [41, 40, 1] [2018-11-23 13:16:00,266 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:16:00,266 INFO L794 eck$LassoCheckResult]: Stem: 10435#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 10436#L10-2 assume !!(main_~i~0 < 100); 10437#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10438#L10-2 assume !!(main_~i~0 < 100); 10433#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10434#L10-2 assume !!(main_~i~0 < 100); 10515#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10514#L10-2 assume !!(main_~i~0 < 100); 10513#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10512#L10-2 assume !!(main_~i~0 < 100); 10511#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10510#L10-2 assume !!(main_~i~0 < 100); 10509#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10508#L10-2 assume !!(main_~i~0 < 100); 10507#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10506#L10-2 assume !!(main_~i~0 < 100); 10505#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10504#L10-2 assume !!(main_~i~0 < 100); 10503#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10502#L10-2 assume !!(main_~i~0 < 100); 10501#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10500#L10-2 assume !!(main_~i~0 < 100); 10499#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10498#L10-2 assume !!(main_~i~0 < 100); 10497#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10496#L10-2 assume !!(main_~i~0 < 100); 10495#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10494#L10-2 assume !!(main_~i~0 < 100); 10493#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10492#L10-2 assume !!(main_~i~0 < 100); 10491#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10490#L10-2 assume !!(main_~i~0 < 100); 10489#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10488#L10-2 assume !!(main_~i~0 < 100); 10487#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10486#L10-2 assume !!(main_~i~0 < 100); 10485#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10484#L10-2 assume !!(main_~i~0 < 100); 10483#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10482#L10-2 assume !!(main_~i~0 < 100); 10481#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10480#L10-2 assume !!(main_~i~0 < 100); 10479#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10478#L10-2 assume !!(main_~i~0 < 100); 10477#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10476#L10-2 assume !!(main_~i~0 < 100); 10475#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10474#L10-2 assume !!(main_~i~0 < 100); 10473#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10472#L10-2 assume !!(main_~i~0 < 100); 10471#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10470#L10-2 assume !!(main_~i~0 < 100); 10469#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10468#L10-2 assume !!(main_~i~0 < 100); 10467#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10466#L10-2 assume !!(main_~i~0 < 100); 10465#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10464#L10-2 assume !!(main_~i~0 < 100); 10463#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10462#L10-2 assume !!(main_~i~0 < 100); 10461#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10460#L10-2 assume !!(main_~i~0 < 100); 10459#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10458#L10-2 assume !!(main_~i~0 < 100); 10457#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10456#L10-2 assume !!(main_~i~0 < 100); 10455#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10454#L10-2 assume !!(main_~i~0 < 100); 10453#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10452#L10-2 assume !!(main_~i~0 < 100); 10451#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10450#L10-2 assume !!(main_~i~0 < 100); 10449#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10448#L10-2 assume !!(main_~i~0 < 100); 10447#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10446#L10-2 assume !!(main_~i~0 < 100); 10445#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10444#L10-2 assume !!(main_~i~0 < 100); 10442#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10441#L10-2 assume !!(main_~i~0 < 100); 10440#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10439#L10-2 assume !!(main_~i~0 < 100); 10431#L10 [2018-11-23 13:16:00,266 INFO L796 eck$LassoCheckResult]: Loop: 10431#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 10432#L10-2 assume !!(main_~i~0 < 100); 10440#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10439#L10-2 assume !!(main_~i~0 < 100); 10431#L10 [2018-11-23 13:16:00,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash 201668978, now seen corresponding path program 40 times [2018-11-23 13:16:00,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:00,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:00,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:00,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:00,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 38 times [2018-11-23 13:16:00,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:00,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:00,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:00,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:00,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:00,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:00,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1425135318, now seen corresponding path program 40 times [2018-11-23 13:16:00,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:00,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:00,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:00,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:00,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 123 proven. 1640 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:00,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:00,685 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:00,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:16:00,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:16:00,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:00,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 123 proven. 1640 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:00,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:00,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-11-23 13:16:00,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 13:16:00,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 13:16:00,737 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. cyclomatic complexity: 3 Second operand 43 states. [2018-11-23 13:16:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:00,786 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-11-23 13:16:00,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 13:16:00,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 91 transitions. [2018-11-23 13:16:00,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:00,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 88 states and 90 transitions. [2018-11-23 13:16:00,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:16:00,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:16:00,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 90 transitions. [2018-11-23 13:16:00,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:16:00,787 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-11-23 13:16:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 90 transitions. [2018-11-23 13:16:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 13:16:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 13:16:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-11-23 13:16:00,789 INFO L728 BuchiCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-11-23 13:16:00,789 INFO L608 BuchiCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-11-23 13:16:00,789 INFO L442 BuchiCegarLoop]: ======== Iteration 43============ [2018-11-23 13:16:00,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 89 transitions. [2018-11-23 13:16:00,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:00,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:16:00,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:16:00,790 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [42, 41, 1] [2018-11-23 13:16:00,790 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:16:00,790 INFO L794 eck$LassoCheckResult]: Stem: 10912#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 10913#L10-2 assume !!(main_~i~0 < 100); 10914#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10915#L10-2 assume !!(main_~i~0 < 100); 10910#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10911#L10-2 assume !!(main_~i~0 < 100); 10994#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10993#L10-2 assume !!(main_~i~0 < 100); 10992#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10991#L10-2 assume !!(main_~i~0 < 100); 10990#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10989#L10-2 assume !!(main_~i~0 < 100); 10988#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10987#L10-2 assume !!(main_~i~0 < 100); 10986#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10985#L10-2 assume !!(main_~i~0 < 100); 10984#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10983#L10-2 assume !!(main_~i~0 < 100); 10982#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10981#L10-2 assume !!(main_~i~0 < 100); 10980#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10979#L10-2 assume !!(main_~i~0 < 100); 10978#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10977#L10-2 assume !!(main_~i~0 < 100); 10976#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10975#L10-2 assume !!(main_~i~0 < 100); 10974#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10973#L10-2 assume !!(main_~i~0 < 100); 10972#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10971#L10-2 assume !!(main_~i~0 < 100); 10970#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10969#L10-2 assume !!(main_~i~0 < 100); 10968#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10967#L10-2 assume !!(main_~i~0 < 100); 10966#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10965#L10-2 assume !!(main_~i~0 < 100); 10964#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10963#L10-2 assume !!(main_~i~0 < 100); 10962#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10961#L10-2 assume !!(main_~i~0 < 100); 10960#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10959#L10-2 assume !!(main_~i~0 < 100); 10958#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10957#L10-2 assume !!(main_~i~0 < 100); 10956#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10955#L10-2 assume !!(main_~i~0 < 100); 10954#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10953#L10-2 assume !!(main_~i~0 < 100); 10952#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10951#L10-2 assume !!(main_~i~0 < 100); 10950#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10949#L10-2 assume !!(main_~i~0 < 100); 10948#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10947#L10-2 assume !!(main_~i~0 < 100); 10946#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10945#L10-2 assume !!(main_~i~0 < 100); 10944#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10943#L10-2 assume !!(main_~i~0 < 100); 10942#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10941#L10-2 assume !!(main_~i~0 < 100); 10940#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10939#L10-2 assume !!(main_~i~0 < 100); 10938#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10937#L10-2 assume !!(main_~i~0 < 100); 10936#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10935#L10-2 assume !!(main_~i~0 < 100); 10934#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10933#L10-2 assume !!(main_~i~0 < 100); 10932#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10931#L10-2 assume !!(main_~i~0 < 100); 10930#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10929#L10-2 assume !!(main_~i~0 < 100); 10928#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10927#L10-2 assume !!(main_~i~0 < 100); 10926#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10925#L10-2 assume !!(main_~i~0 < 100); 10924#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10923#L10-2 assume !!(main_~i~0 < 100); 10922#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10921#L10-2 assume !!(main_~i~0 < 100); 10919#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10918#L10-2 assume !!(main_~i~0 < 100); 10917#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10916#L10-2 assume !!(main_~i~0 < 100); 10908#L10 [2018-11-23 13:16:00,790 INFO L796 eck$LassoCheckResult]: Loop: 10908#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 10909#L10-2 assume !!(main_~i~0 < 100); 10917#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 10916#L10-2 assume !!(main_~i~0 < 100); 10908#L10 [2018-11-23 13:16:00,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash 530359951, now seen corresponding path program 41 times [2018-11-23 13:16:00,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:00,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:00,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:00,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:00,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:00,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:00,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 39 times [2018-11-23 13:16:00,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:00,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:00,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:00,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:00,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:00,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:00,807 INFO L82 PathProgramCache]: Analyzing trace with hash 482328519, now seen corresponding path program 41 times [2018-11-23 13:16:00,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:00,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:00,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:00,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:00,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:01,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 126 proven. 1722 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:01,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:01,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:01,257 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:16:01,282 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2018-11-23 13:16:01,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:01,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 126 proven. 1722 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:01,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:01,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-11-23 13:16:01,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 13:16:01,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 13:16:01,322 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. cyclomatic complexity: 3 Second operand 44 states. [2018-11-23 13:16:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:01,379 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-11-23 13:16:01,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 13:16:01,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 93 transitions. [2018-11-23 13:16:01,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:01,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 90 states and 92 transitions. [2018-11-23 13:16:01,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:16:01,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:16:01,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 92 transitions. [2018-11-23 13:16:01,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:16:01,381 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-11-23 13:16:01,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 92 transitions. [2018-11-23 13:16:01,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 13:16:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 13:16:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-11-23 13:16:01,382 INFO L728 BuchiCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-11-23 13:16:01,382 INFO L608 BuchiCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-11-23 13:16:01,382 INFO L442 BuchiCegarLoop]: ======== Iteration 44============ [2018-11-23 13:16:01,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 91 transitions. [2018-11-23 13:16:01,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:01,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:16:01,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:16:01,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [43, 42, 1] [2018-11-23 13:16:01,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:16:01,384 INFO L794 eck$LassoCheckResult]: Stem: 11400#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 11401#L10-2 assume !!(main_~i~0 < 100); 11402#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11403#L10-2 assume !!(main_~i~0 < 100); 11398#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11399#L10-2 assume !!(main_~i~0 < 100); 11484#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11483#L10-2 assume !!(main_~i~0 < 100); 11482#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11481#L10-2 assume !!(main_~i~0 < 100); 11480#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11479#L10-2 assume !!(main_~i~0 < 100); 11478#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11477#L10-2 assume !!(main_~i~0 < 100); 11476#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11475#L10-2 assume !!(main_~i~0 < 100); 11474#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11473#L10-2 assume !!(main_~i~0 < 100); 11472#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11471#L10-2 assume !!(main_~i~0 < 100); 11470#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11469#L10-2 assume !!(main_~i~0 < 100); 11468#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11467#L10-2 assume !!(main_~i~0 < 100); 11466#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11465#L10-2 assume !!(main_~i~0 < 100); 11464#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11463#L10-2 assume !!(main_~i~0 < 100); 11462#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11461#L10-2 assume !!(main_~i~0 < 100); 11460#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11459#L10-2 assume !!(main_~i~0 < 100); 11458#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11457#L10-2 assume !!(main_~i~0 < 100); 11456#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11455#L10-2 assume !!(main_~i~0 < 100); 11454#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11453#L10-2 assume !!(main_~i~0 < 100); 11452#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11451#L10-2 assume !!(main_~i~0 < 100); 11450#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11449#L10-2 assume !!(main_~i~0 < 100); 11448#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11447#L10-2 assume !!(main_~i~0 < 100); 11446#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11445#L10-2 assume !!(main_~i~0 < 100); 11444#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11443#L10-2 assume !!(main_~i~0 < 100); 11442#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11441#L10-2 assume !!(main_~i~0 < 100); 11440#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11439#L10-2 assume !!(main_~i~0 < 100); 11438#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11437#L10-2 assume !!(main_~i~0 < 100); 11436#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11435#L10-2 assume !!(main_~i~0 < 100); 11434#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11433#L10-2 assume !!(main_~i~0 < 100); 11432#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11431#L10-2 assume !!(main_~i~0 < 100); 11430#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11429#L10-2 assume !!(main_~i~0 < 100); 11428#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11427#L10-2 assume !!(main_~i~0 < 100); 11426#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11425#L10-2 assume !!(main_~i~0 < 100); 11424#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11423#L10-2 assume !!(main_~i~0 < 100); 11422#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11421#L10-2 assume !!(main_~i~0 < 100); 11420#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11419#L10-2 assume !!(main_~i~0 < 100); 11418#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11417#L10-2 assume !!(main_~i~0 < 100); 11416#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11415#L10-2 assume !!(main_~i~0 < 100); 11414#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11413#L10-2 assume !!(main_~i~0 < 100); 11412#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11411#L10-2 assume !!(main_~i~0 < 100); 11410#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11409#L10-2 assume !!(main_~i~0 < 100); 11407#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11406#L10-2 assume !!(main_~i~0 < 100); 11405#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11404#L10-2 assume !!(main_~i~0 < 100); 11396#L10 [2018-11-23 13:16:01,384 INFO L796 eck$LassoCheckResult]: Loop: 11396#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 11397#L10-2 assume !!(main_~i~0 < 100); 11405#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11404#L10-2 assume !!(main_~i~0 < 100); 11396#L10 [2018-11-23 13:16:01,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:01,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1425194900, now seen corresponding path program 42 times [2018-11-23 13:16:01,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:01,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:01,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:01,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:01,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:01,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:01,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 40 times [2018-11-23 13:16:01,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:01,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:01,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:01,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:01,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:01,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:01,401 INFO L82 PathProgramCache]: Analyzing trace with hash -395959516, now seen corresponding path program 42 times [2018-11-23 13:16:01,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:01,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:01,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:01,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:01,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:01,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 129 proven. 1806 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:01,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:01,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:01,861 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:16:01,886 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2018-11-23 13:16:01,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:01,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 129 proven. 1806 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:01,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:01,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-11-23 13:16:01,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 13:16:01,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 13:16:01,923 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. cyclomatic complexity: 3 Second operand 45 states. [2018-11-23 13:16:01,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:01,979 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-11-23 13:16:01,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 13:16:01,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 95 transitions. [2018-11-23 13:16:01,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:01,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 94 transitions. [2018-11-23 13:16:01,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:16:01,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:16:01,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 94 transitions. [2018-11-23 13:16:01,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:16:01,980 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-11-23 13:16:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 94 transitions. [2018-11-23 13:16:01,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-11-23 13:16:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 13:16:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-11-23 13:16:01,981 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-11-23 13:16:01,981 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-11-23 13:16:01,981 INFO L442 BuchiCegarLoop]: ======== Iteration 45============ [2018-11-23 13:16:01,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 93 transitions. [2018-11-23 13:16:01,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:01,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:16:01,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:16:01,982 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [44, 43, 1] [2018-11-23 13:16:01,982 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:16:01,982 INFO L794 eck$LassoCheckResult]: Stem: 11899#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 11900#L10-2 assume !!(main_~i~0 < 100); 11901#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11902#L10-2 assume !!(main_~i~0 < 100); 11897#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11898#L10-2 assume !!(main_~i~0 < 100); 11985#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11984#L10-2 assume !!(main_~i~0 < 100); 11983#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11982#L10-2 assume !!(main_~i~0 < 100); 11981#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11980#L10-2 assume !!(main_~i~0 < 100); 11979#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11978#L10-2 assume !!(main_~i~0 < 100); 11977#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11976#L10-2 assume !!(main_~i~0 < 100); 11975#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11974#L10-2 assume !!(main_~i~0 < 100); 11973#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11972#L10-2 assume !!(main_~i~0 < 100); 11971#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11970#L10-2 assume !!(main_~i~0 < 100); 11969#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11968#L10-2 assume !!(main_~i~0 < 100); 11967#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11966#L10-2 assume !!(main_~i~0 < 100); 11965#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11964#L10-2 assume !!(main_~i~0 < 100); 11963#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11962#L10-2 assume !!(main_~i~0 < 100); 11961#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11960#L10-2 assume !!(main_~i~0 < 100); 11959#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11958#L10-2 assume !!(main_~i~0 < 100); 11957#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11956#L10-2 assume !!(main_~i~0 < 100); 11955#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11954#L10-2 assume !!(main_~i~0 < 100); 11953#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11952#L10-2 assume !!(main_~i~0 < 100); 11951#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11950#L10-2 assume !!(main_~i~0 < 100); 11949#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11948#L10-2 assume !!(main_~i~0 < 100); 11947#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11946#L10-2 assume !!(main_~i~0 < 100); 11945#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11944#L10-2 assume !!(main_~i~0 < 100); 11943#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11942#L10-2 assume !!(main_~i~0 < 100); 11941#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11940#L10-2 assume !!(main_~i~0 < 100); 11939#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11938#L10-2 assume !!(main_~i~0 < 100); 11937#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11936#L10-2 assume !!(main_~i~0 < 100); 11935#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11934#L10-2 assume !!(main_~i~0 < 100); 11933#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11932#L10-2 assume !!(main_~i~0 < 100); 11931#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11930#L10-2 assume !!(main_~i~0 < 100); 11929#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11928#L10-2 assume !!(main_~i~0 < 100); 11927#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11926#L10-2 assume !!(main_~i~0 < 100); 11925#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11924#L10-2 assume !!(main_~i~0 < 100); 11923#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11922#L10-2 assume !!(main_~i~0 < 100); 11921#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11920#L10-2 assume !!(main_~i~0 < 100); 11919#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11918#L10-2 assume !!(main_~i~0 < 100); 11917#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11916#L10-2 assume !!(main_~i~0 < 100); 11915#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11914#L10-2 assume !!(main_~i~0 < 100); 11913#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11912#L10-2 assume !!(main_~i~0 < 100); 11911#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11910#L10-2 assume !!(main_~i~0 < 100); 11909#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11908#L10-2 assume !!(main_~i~0 < 100); 11906#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11905#L10-2 assume !!(main_~i~0 < 100); 11904#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11903#L10-2 assume !!(main_~i~0 < 100); 11895#L10 [2018-11-23 13:16:01,982 INFO L796 eck$LassoCheckResult]: Loop: 11895#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 11896#L10-2 assume !!(main_~i~0 < 100); 11904#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 11903#L10-2 assume !!(main_~i~0 < 100); 11895#L10 [2018-11-23 13:16:01,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:01,982 INFO L82 PathProgramCache]: Analyzing trace with hash 482268937, now seen corresponding path program 43 times [2018-11-23 13:16:01,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:01,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:01,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:01,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:01,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 41 times [2018-11-23 13:16:01,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:01,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:01,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:01,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:01,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:01,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:01,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1677796161, now seen corresponding path program 43 times [2018-11-23 13:16:01,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:01,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:01,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:01,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:01,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 132 proven. 1892 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:02,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:02,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:02,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:02,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 132 proven. 1892 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:02,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:02,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-11-23 13:16:02,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 13:16:02,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 13:16:02,542 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. cyclomatic complexity: 3 Second operand 46 states. [2018-11-23 13:16:02,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:02,600 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-23 13:16:02,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 13:16:02,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 97 transitions. [2018-11-23 13:16:02,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:02,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 94 states and 96 transitions. [2018-11-23 13:16:02,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:16:02,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:16:02,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 96 transitions. [2018-11-23 13:16:02,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:16:02,601 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-11-23 13:16:02,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 96 transitions. [2018-11-23 13:16:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-11-23 13:16:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 13:16:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2018-11-23 13:16:02,603 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-11-23 13:16:02,603 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-11-23 13:16:02,603 INFO L442 BuchiCegarLoop]: ======== Iteration 46============ [2018-11-23 13:16:02,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 95 transitions. [2018-11-23 13:16:02,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:02,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:16:02,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:16:02,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [45, 44, 1] [2018-11-23 13:16:02,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:16:02,604 INFO L794 eck$LassoCheckResult]: Stem: 12409#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 12410#L10-2 assume !!(main_~i~0 < 100); 12411#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12412#L10-2 assume !!(main_~i~0 < 100); 12407#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12408#L10-2 assume !!(main_~i~0 < 100); 12497#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12496#L10-2 assume !!(main_~i~0 < 100); 12495#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12494#L10-2 assume !!(main_~i~0 < 100); 12493#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12492#L10-2 assume !!(main_~i~0 < 100); 12491#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12490#L10-2 assume !!(main_~i~0 < 100); 12489#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12488#L10-2 assume !!(main_~i~0 < 100); 12487#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12486#L10-2 assume !!(main_~i~0 < 100); 12485#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12484#L10-2 assume !!(main_~i~0 < 100); 12483#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12482#L10-2 assume !!(main_~i~0 < 100); 12481#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12480#L10-2 assume !!(main_~i~0 < 100); 12479#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12478#L10-2 assume !!(main_~i~0 < 100); 12477#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12476#L10-2 assume !!(main_~i~0 < 100); 12475#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12474#L10-2 assume !!(main_~i~0 < 100); 12473#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12472#L10-2 assume !!(main_~i~0 < 100); 12471#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12470#L10-2 assume !!(main_~i~0 < 100); 12469#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12468#L10-2 assume !!(main_~i~0 < 100); 12467#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12466#L10-2 assume !!(main_~i~0 < 100); 12465#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12464#L10-2 assume !!(main_~i~0 < 100); 12463#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12462#L10-2 assume !!(main_~i~0 < 100); 12461#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12460#L10-2 assume !!(main_~i~0 < 100); 12459#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12458#L10-2 assume !!(main_~i~0 < 100); 12457#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12456#L10-2 assume !!(main_~i~0 < 100); 12455#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12454#L10-2 assume !!(main_~i~0 < 100); 12453#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12452#L10-2 assume !!(main_~i~0 < 100); 12451#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12450#L10-2 assume !!(main_~i~0 < 100); 12449#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12448#L10-2 assume !!(main_~i~0 < 100); 12447#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12446#L10-2 assume !!(main_~i~0 < 100); 12445#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12444#L10-2 assume !!(main_~i~0 < 100); 12443#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12442#L10-2 assume !!(main_~i~0 < 100); 12441#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12440#L10-2 assume !!(main_~i~0 < 100); 12439#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12438#L10-2 assume !!(main_~i~0 < 100); 12437#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12436#L10-2 assume !!(main_~i~0 < 100); 12435#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12434#L10-2 assume !!(main_~i~0 < 100); 12433#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12432#L10-2 assume !!(main_~i~0 < 100); 12431#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12430#L10-2 assume !!(main_~i~0 < 100); 12429#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12428#L10-2 assume !!(main_~i~0 < 100); 12427#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12426#L10-2 assume !!(main_~i~0 < 100); 12425#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12424#L10-2 assume !!(main_~i~0 < 100); 12423#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12422#L10-2 assume !!(main_~i~0 < 100); 12421#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12420#L10-2 assume !!(main_~i~0 < 100); 12419#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12418#L10-2 assume !!(main_~i~0 < 100); 12416#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12415#L10-2 assume !!(main_~i~0 < 100); 12414#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12413#L10-2 assume !!(main_~i~0 < 100); 12405#L10 [2018-11-23 13:16:02,604 INFO L796 eck$LassoCheckResult]: Loop: 12405#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 12406#L10-2 assume !!(main_~i~0 < 100); 12414#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12413#L10-2 assume !!(main_~i~0 < 100); 12405#L10 [2018-11-23 13:16:02,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:02,604 INFO L82 PathProgramCache]: Analyzing trace with hash -396019098, now seen corresponding path program 44 times [2018-11-23 13:16:02,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:02,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:02,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:02,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:02,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:02,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:02,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 42 times [2018-11-23 13:16:02,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:02,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:02,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:02,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:02,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:02,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:02,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1692176414, now seen corresponding path program 44 times [2018-11-23 13:16:02,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:02,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:02,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:02,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:02,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 135 proven. 1980 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:03,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:03,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:03,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:16:03,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:16:03,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:03,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 135 proven. 1980 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:03,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:03,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-11-23 13:16:03,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 13:16:03,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 13:16:03,217 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. cyclomatic complexity: 3 Second operand 47 states. [2018-11-23 13:16:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:03,292 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-11-23 13:16:03,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 13:16:03,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 99 transitions. [2018-11-23 13:16:03,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:03,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 96 states and 98 transitions. [2018-11-23 13:16:03,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:16:03,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:16:03,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 98 transitions. [2018-11-23 13:16:03,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:16:03,295 INFO L705 BuchiCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-11-23 13:16:03,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 98 transitions. [2018-11-23 13:16:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-23 13:16:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 13:16:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-11-23 13:16:03,296 INFO L728 BuchiCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-11-23 13:16:03,297 INFO L608 BuchiCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-11-23 13:16:03,297 INFO L442 BuchiCegarLoop]: ======== Iteration 47============ [2018-11-23 13:16:03,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 97 transitions. [2018-11-23 13:16:03,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:03,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:16:03,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:16:03,298 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [46, 45, 1] [2018-11-23 13:16:03,298 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:16:03,298 INFO L794 eck$LassoCheckResult]: Stem: 12930#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 12931#L10-2 assume !!(main_~i~0 < 100); 12932#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12933#L10-2 assume !!(main_~i~0 < 100); 12928#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12929#L10-2 assume !!(main_~i~0 < 100); 13020#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13019#L10-2 assume !!(main_~i~0 < 100); 13018#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13017#L10-2 assume !!(main_~i~0 < 100); 13016#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13015#L10-2 assume !!(main_~i~0 < 100); 13014#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13013#L10-2 assume !!(main_~i~0 < 100); 13012#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13011#L10-2 assume !!(main_~i~0 < 100); 13010#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13009#L10-2 assume !!(main_~i~0 < 100); 13008#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13007#L10-2 assume !!(main_~i~0 < 100); 13006#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13005#L10-2 assume !!(main_~i~0 < 100); 13004#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13003#L10-2 assume !!(main_~i~0 < 100); 13002#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13001#L10-2 assume !!(main_~i~0 < 100); 13000#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12999#L10-2 assume !!(main_~i~0 < 100); 12998#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12997#L10-2 assume !!(main_~i~0 < 100); 12996#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12995#L10-2 assume !!(main_~i~0 < 100); 12994#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12993#L10-2 assume !!(main_~i~0 < 100); 12992#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12991#L10-2 assume !!(main_~i~0 < 100); 12990#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12989#L10-2 assume !!(main_~i~0 < 100); 12988#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12987#L10-2 assume !!(main_~i~0 < 100); 12986#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12985#L10-2 assume !!(main_~i~0 < 100); 12984#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12983#L10-2 assume !!(main_~i~0 < 100); 12982#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12981#L10-2 assume !!(main_~i~0 < 100); 12980#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12979#L10-2 assume !!(main_~i~0 < 100); 12978#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12977#L10-2 assume !!(main_~i~0 < 100); 12976#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12975#L10-2 assume !!(main_~i~0 < 100); 12974#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12973#L10-2 assume !!(main_~i~0 < 100); 12972#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12971#L10-2 assume !!(main_~i~0 < 100); 12970#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12969#L10-2 assume !!(main_~i~0 < 100); 12968#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12967#L10-2 assume !!(main_~i~0 < 100); 12966#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12965#L10-2 assume !!(main_~i~0 < 100); 12964#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12963#L10-2 assume !!(main_~i~0 < 100); 12962#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12961#L10-2 assume !!(main_~i~0 < 100); 12960#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12959#L10-2 assume !!(main_~i~0 < 100); 12958#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12957#L10-2 assume !!(main_~i~0 < 100); 12956#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12955#L10-2 assume !!(main_~i~0 < 100); 12954#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12953#L10-2 assume !!(main_~i~0 < 100); 12952#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12951#L10-2 assume !!(main_~i~0 < 100); 12950#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12949#L10-2 assume !!(main_~i~0 < 100); 12948#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12947#L10-2 assume !!(main_~i~0 < 100); 12946#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12945#L10-2 assume !!(main_~i~0 < 100); 12944#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12943#L10-2 assume !!(main_~i~0 < 100); 12942#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12941#L10-2 assume !!(main_~i~0 < 100); 12940#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12939#L10-2 assume !!(main_~i~0 < 100); 12937#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12936#L10-2 assume !!(main_~i~0 < 100); 12935#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12934#L10-2 assume !!(main_~i~0 < 100); 12926#L10 [2018-11-23 13:16:03,298 INFO L796 eck$LassoCheckResult]: Loop: 12926#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 12927#L10-2 assume !!(main_~i~0 < 100); 12935#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 12934#L10-2 assume !!(main_~i~0 < 100); 12926#L10 [2018-11-23 13:16:03,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:03,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1677736579, now seen corresponding path program 45 times [2018-11-23 13:16:03,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:03,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:03,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:03,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:03,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:03,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:03,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 43 times [2018-11-23 13:16:03,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:03,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:03,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:03,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:03,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:03,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:03,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1668269637, now seen corresponding path program 45 times [2018-11-23 13:16:03,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:03,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:03,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:03,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:03,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 138 proven. 2070 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:03,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:03,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:03,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:16:03,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-11-23 13:16:03,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:03,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 138 proven. 2070 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:03,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:03,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-11-23 13:16:03,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 13:16:03,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 13:16:03,977 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. cyclomatic complexity: 3 Second operand 48 states. [2018-11-23 13:16:04,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:04,034 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-11-23 13:16:04,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 13:16:04,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 101 transitions. [2018-11-23 13:16:04,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:04,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 98 states and 100 transitions. [2018-11-23 13:16:04,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:16:04,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:16:04,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 100 transitions. [2018-11-23 13:16:04,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:16:04,035 INFO L705 BuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-11-23 13:16:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 100 transitions. [2018-11-23 13:16:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-11-23 13:16:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 13:16:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-11-23 13:16:04,037 INFO L728 BuchiCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-11-23 13:16:04,037 INFO L608 BuchiCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-11-23 13:16:04,037 INFO L442 BuchiCegarLoop]: ======== Iteration 48============ [2018-11-23 13:16:04,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 99 transitions. [2018-11-23 13:16:04,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:04,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:16:04,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:16:04,037 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [47, 46, 1] [2018-11-23 13:16:04,037 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:16:04,038 INFO L794 eck$LassoCheckResult]: Stem: 13462#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 13463#L10-2 assume !!(main_~i~0 < 100); 13464#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13465#L10-2 assume !!(main_~i~0 < 100); 13460#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13461#L10-2 assume !!(main_~i~0 < 100); 13554#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13553#L10-2 assume !!(main_~i~0 < 100); 13552#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13551#L10-2 assume !!(main_~i~0 < 100); 13550#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13549#L10-2 assume !!(main_~i~0 < 100); 13548#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13547#L10-2 assume !!(main_~i~0 < 100); 13546#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13545#L10-2 assume !!(main_~i~0 < 100); 13544#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13543#L10-2 assume !!(main_~i~0 < 100); 13542#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13541#L10-2 assume !!(main_~i~0 < 100); 13540#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13539#L10-2 assume !!(main_~i~0 < 100); 13538#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13537#L10-2 assume !!(main_~i~0 < 100); 13536#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13535#L10-2 assume !!(main_~i~0 < 100); 13534#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13533#L10-2 assume !!(main_~i~0 < 100); 13532#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13531#L10-2 assume !!(main_~i~0 < 100); 13530#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13529#L10-2 assume !!(main_~i~0 < 100); 13528#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13527#L10-2 assume !!(main_~i~0 < 100); 13526#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13525#L10-2 assume !!(main_~i~0 < 100); 13524#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13523#L10-2 assume !!(main_~i~0 < 100); 13522#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13521#L10-2 assume !!(main_~i~0 < 100); 13520#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13519#L10-2 assume !!(main_~i~0 < 100); 13518#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13517#L10-2 assume !!(main_~i~0 < 100); 13516#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13515#L10-2 assume !!(main_~i~0 < 100); 13514#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13513#L10-2 assume !!(main_~i~0 < 100); 13512#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13511#L10-2 assume !!(main_~i~0 < 100); 13510#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13509#L10-2 assume !!(main_~i~0 < 100); 13508#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13507#L10-2 assume !!(main_~i~0 < 100); 13506#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13505#L10-2 assume !!(main_~i~0 < 100); 13504#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13503#L10-2 assume !!(main_~i~0 < 100); 13502#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13501#L10-2 assume !!(main_~i~0 < 100); 13500#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13499#L10-2 assume !!(main_~i~0 < 100); 13498#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13497#L10-2 assume !!(main_~i~0 < 100); 13496#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13495#L10-2 assume !!(main_~i~0 < 100); 13494#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13493#L10-2 assume !!(main_~i~0 < 100); 13492#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13491#L10-2 assume !!(main_~i~0 < 100); 13490#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13489#L10-2 assume !!(main_~i~0 < 100); 13488#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13487#L10-2 assume !!(main_~i~0 < 100); 13486#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13485#L10-2 assume !!(main_~i~0 < 100); 13484#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13483#L10-2 assume !!(main_~i~0 < 100); 13482#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13481#L10-2 assume !!(main_~i~0 < 100); 13480#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13479#L10-2 assume !!(main_~i~0 < 100); 13478#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13477#L10-2 assume !!(main_~i~0 < 100); 13476#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13475#L10-2 assume !!(main_~i~0 < 100); 13474#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13473#L10-2 assume !!(main_~i~0 < 100); 13472#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13471#L10-2 assume !!(main_~i~0 < 100); 13469#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13468#L10-2 assume !!(main_~i~0 < 100); 13467#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13466#L10-2 assume !!(main_~i~0 < 100); 13458#L10 [2018-11-23 13:16:04,038 INFO L796 eck$LassoCheckResult]: Loop: 13458#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 13459#L10-2 assume !!(main_~i~0 < 100); 13467#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 13466#L10-2 assume !!(main_~i~0 < 100); 13458#L10 [2018-11-23 13:16:04,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:04,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1692116832, now seen corresponding path program 46 times [2018-11-23 13:16:04,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:04,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:04,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:04,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:04,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:04,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:04,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 44 times [2018-11-23 13:16:04,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:04,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:04,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:04,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:04,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:04,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:04,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1241518056, now seen corresponding path program 46 times [2018-11-23 13:16:04,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:04,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:04,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:04,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:04,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:04,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:04,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:04,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:16:04,628 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:16:04,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:04,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:04,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:04,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-11-23 13:16:04,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 13:16:04,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 13:16:04,679 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. cyclomatic complexity: 3 Second operand 49 states. [2018-11-23 13:16:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:04,748 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-11-23 13:16:04,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 13:16:04,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 103 transitions. [2018-11-23 13:16:04,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:04,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 100 states and 102 transitions. [2018-11-23 13:16:04,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:16:04,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:16:04,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 102 transitions. [2018-11-23 13:16:04,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:16:04,749 INFO L705 BuchiCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-11-23 13:16:04,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 102 transitions. [2018-11-23 13:16:04,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-11-23 13:16:04,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 13:16:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-11-23 13:16:04,750 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-11-23 13:16:04,750 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-11-23 13:16:04,750 INFO L442 BuchiCegarLoop]: ======== Iteration 49============ [2018-11-23 13:16:04,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 101 transitions. [2018-11-23 13:16:04,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:04,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:16:04,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:16:04,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [48, 47, 1] [2018-11-23 13:16:04,751 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:16:04,751 INFO L794 eck$LassoCheckResult]: Stem: 14005#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 14006#L10-2 assume !!(main_~i~0 < 100); 14007#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14008#L10-2 assume !!(main_~i~0 < 100); 14003#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14004#L10-2 assume !!(main_~i~0 < 100); 14099#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14098#L10-2 assume !!(main_~i~0 < 100); 14097#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14096#L10-2 assume !!(main_~i~0 < 100); 14095#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14094#L10-2 assume !!(main_~i~0 < 100); 14093#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14092#L10-2 assume !!(main_~i~0 < 100); 14091#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14090#L10-2 assume !!(main_~i~0 < 100); 14089#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14088#L10-2 assume !!(main_~i~0 < 100); 14087#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14086#L10-2 assume !!(main_~i~0 < 100); 14085#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14084#L10-2 assume !!(main_~i~0 < 100); 14083#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14082#L10-2 assume !!(main_~i~0 < 100); 14081#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14080#L10-2 assume !!(main_~i~0 < 100); 14079#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14078#L10-2 assume !!(main_~i~0 < 100); 14077#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14076#L10-2 assume !!(main_~i~0 < 100); 14075#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14074#L10-2 assume !!(main_~i~0 < 100); 14073#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14072#L10-2 assume !!(main_~i~0 < 100); 14071#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14070#L10-2 assume !!(main_~i~0 < 100); 14069#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14068#L10-2 assume !!(main_~i~0 < 100); 14067#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14066#L10-2 assume !!(main_~i~0 < 100); 14065#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14064#L10-2 assume !!(main_~i~0 < 100); 14063#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14062#L10-2 assume !!(main_~i~0 < 100); 14061#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14060#L10-2 assume !!(main_~i~0 < 100); 14059#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14058#L10-2 assume !!(main_~i~0 < 100); 14057#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14056#L10-2 assume !!(main_~i~0 < 100); 14055#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14054#L10-2 assume !!(main_~i~0 < 100); 14053#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14052#L10-2 assume !!(main_~i~0 < 100); 14051#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14050#L10-2 assume !!(main_~i~0 < 100); 14049#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14048#L10-2 assume !!(main_~i~0 < 100); 14047#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14046#L10-2 assume !!(main_~i~0 < 100); 14045#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14044#L10-2 assume !!(main_~i~0 < 100); 14043#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14042#L10-2 assume !!(main_~i~0 < 100); 14041#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14040#L10-2 assume !!(main_~i~0 < 100); 14039#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14038#L10-2 assume !!(main_~i~0 < 100); 14037#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14036#L10-2 assume !!(main_~i~0 < 100); 14035#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14034#L10-2 assume !!(main_~i~0 < 100); 14033#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14032#L10-2 assume !!(main_~i~0 < 100); 14031#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14030#L10-2 assume !!(main_~i~0 < 100); 14029#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14028#L10-2 assume !!(main_~i~0 < 100); 14027#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14026#L10-2 assume !!(main_~i~0 < 100); 14025#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14024#L10-2 assume !!(main_~i~0 < 100); 14023#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14022#L10-2 assume !!(main_~i~0 < 100); 14021#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14020#L10-2 assume !!(main_~i~0 < 100); 14019#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14018#L10-2 assume !!(main_~i~0 < 100); 14017#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14016#L10-2 assume !!(main_~i~0 < 100); 14015#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14014#L10-2 assume !!(main_~i~0 < 100); 14012#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14011#L10-2 assume !!(main_~i~0 < 100); 14010#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14009#L10-2 assume !!(main_~i~0 < 100); 14001#L10 [2018-11-23 13:16:04,751 INFO L796 eck$LassoCheckResult]: Loop: 14001#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 14002#L10-2 assume !!(main_~i~0 < 100); 14010#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14009#L10-2 assume !!(main_~i~0 < 100); 14001#L10 [2018-11-23 13:16:04,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:04,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1668329219, now seen corresponding path program 47 times [2018-11-23 13:16:04,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:04,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:04,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:04,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:04,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:04,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:04,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 45 times [2018-11-23 13:16:04,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:04,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:04,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:04,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:04,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:04,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:04,764 INFO L82 PathProgramCache]: Analyzing trace with hash 844858165, now seen corresponding path program 47 times [2018-11-23 13:16:04,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:04,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:04,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:04,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:04,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 144 proven. 2256 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:05,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:05,299 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:05,307 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:16:05,335 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2018-11-23 13:16:05,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:05,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 144 proven. 2256 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:05,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:05,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-11-23 13:16:05,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 13:16:05,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 13:16:05,373 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. cyclomatic complexity: 3 Second operand 50 states. [2018-11-23 13:16:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:05,431 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-11-23 13:16:05,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 13:16:05,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 105 transitions. [2018-11-23 13:16:05,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:05,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 102 states and 104 transitions. [2018-11-23 13:16:05,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:16:05,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:16:05,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 104 transitions. [2018-11-23 13:16:05,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:16:05,433 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-11-23 13:16:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 104 transitions. [2018-11-23 13:16:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-11-23 13:16:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 13:16:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-11-23 13:16:05,434 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-11-23 13:16:05,434 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-11-23 13:16:05,434 INFO L442 BuchiCegarLoop]: ======== Iteration 50============ [2018-11-23 13:16:05,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 103 transitions. [2018-11-23 13:16:05,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:05,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:16:05,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:16:05,435 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [49, 48, 1] [2018-11-23 13:16:05,435 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:16:05,436 INFO L794 eck$LassoCheckResult]: Stem: 14559#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 14560#L10-2 assume !!(main_~i~0 < 100); 14561#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14562#L10-2 assume !!(main_~i~0 < 100); 14557#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14558#L10-2 assume !!(main_~i~0 < 100); 14655#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14654#L10-2 assume !!(main_~i~0 < 100); 14653#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14652#L10-2 assume !!(main_~i~0 < 100); 14651#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14650#L10-2 assume !!(main_~i~0 < 100); 14649#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14648#L10-2 assume !!(main_~i~0 < 100); 14647#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14646#L10-2 assume !!(main_~i~0 < 100); 14645#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14644#L10-2 assume !!(main_~i~0 < 100); 14643#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14642#L10-2 assume !!(main_~i~0 < 100); 14641#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14640#L10-2 assume !!(main_~i~0 < 100); 14639#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14638#L10-2 assume !!(main_~i~0 < 100); 14637#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14636#L10-2 assume !!(main_~i~0 < 100); 14635#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14634#L10-2 assume !!(main_~i~0 < 100); 14633#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14632#L10-2 assume !!(main_~i~0 < 100); 14631#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14630#L10-2 assume !!(main_~i~0 < 100); 14629#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14628#L10-2 assume !!(main_~i~0 < 100); 14627#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14626#L10-2 assume !!(main_~i~0 < 100); 14625#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14624#L10-2 assume !!(main_~i~0 < 100); 14623#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14622#L10-2 assume !!(main_~i~0 < 100); 14621#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14620#L10-2 assume !!(main_~i~0 < 100); 14619#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14618#L10-2 assume !!(main_~i~0 < 100); 14617#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14616#L10-2 assume !!(main_~i~0 < 100); 14615#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14614#L10-2 assume !!(main_~i~0 < 100); 14613#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14612#L10-2 assume !!(main_~i~0 < 100); 14611#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14610#L10-2 assume !!(main_~i~0 < 100); 14609#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14608#L10-2 assume !!(main_~i~0 < 100); 14607#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14606#L10-2 assume !!(main_~i~0 < 100); 14605#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14604#L10-2 assume !!(main_~i~0 < 100); 14603#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14602#L10-2 assume !!(main_~i~0 < 100); 14601#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14600#L10-2 assume !!(main_~i~0 < 100); 14599#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14598#L10-2 assume !!(main_~i~0 < 100); 14597#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14596#L10-2 assume !!(main_~i~0 < 100); 14595#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14594#L10-2 assume !!(main_~i~0 < 100); 14593#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14592#L10-2 assume !!(main_~i~0 < 100); 14591#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14590#L10-2 assume !!(main_~i~0 < 100); 14589#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14588#L10-2 assume !!(main_~i~0 < 100); 14587#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14586#L10-2 assume !!(main_~i~0 < 100); 14585#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14584#L10-2 assume !!(main_~i~0 < 100); 14583#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14582#L10-2 assume !!(main_~i~0 < 100); 14581#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14580#L10-2 assume !!(main_~i~0 < 100); 14579#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14578#L10-2 assume !!(main_~i~0 < 100); 14577#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14576#L10-2 assume !!(main_~i~0 < 100); 14575#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14574#L10-2 assume !!(main_~i~0 < 100); 14573#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14572#L10-2 assume !!(main_~i~0 < 100); 14571#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14570#L10-2 assume !!(main_~i~0 < 100); 14569#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14568#L10-2 assume !!(main_~i~0 < 100); 14566#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14565#L10-2 assume !!(main_~i~0 < 100); 14564#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14563#L10-2 assume !!(main_~i~0 < 100); 14555#L10 [2018-11-23 13:16:05,436 INFO L796 eck$LassoCheckResult]: Loop: 14555#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 14556#L10-2 assume !!(main_~i~0 < 100); 14564#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 14563#L10-2 assume !!(main_~i~0 < 100); 14555#L10 [2018-11-23 13:16:05,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:05,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1241577638, now seen corresponding path program 48 times [2018-11-23 13:16:05,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:05,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:05,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:05,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:05,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:05,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 46 times [2018-11-23 13:16:05,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:05,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:05,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:05,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:05,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:05,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:05,456 INFO L82 PathProgramCache]: Analyzing trace with hash 102679314, now seen corresponding path program 48 times [2018-11-23 13:16:05,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:05,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:05,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:05,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:05,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 147 proven. 2352 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:06,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:06,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:06,036 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:16:06,065 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2018-11-23 13:16:06,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:06,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 147 proven. 2352 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:06,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:06,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-11-23 13:16:06,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 13:16:06,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 13:16:06,102 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. cyclomatic complexity: 3 Second operand 51 states. [2018-11-23 13:16:06,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:06,175 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-11-23 13:16:06,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 13:16:06,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 107 transitions. [2018-11-23 13:16:06,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:06,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 104 states and 106 transitions. [2018-11-23 13:16:06,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:16:06,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:16:06,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 106 transitions. [2018-11-23 13:16:06,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:16:06,176 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-11-23 13:16:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 106 transitions. [2018-11-23 13:16:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-11-23 13:16:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 13:16:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-11-23 13:16:06,178 INFO L728 BuchiCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-11-23 13:16:06,178 INFO L608 BuchiCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-11-23 13:16:06,178 INFO L442 BuchiCegarLoop]: ======== Iteration 51============ [2018-11-23 13:16:06,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 105 transitions. [2018-11-23 13:16:06,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:06,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:16:06,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:16:06,179 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [50, 49, 1] [2018-11-23 13:16:06,179 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:16:06,179 INFO L794 eck$LassoCheckResult]: Stem: 15124#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 15125#L10-2 assume !!(main_~i~0 < 100); 15126#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15127#L10-2 assume !!(main_~i~0 < 100); 15122#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15123#L10-2 assume !!(main_~i~0 < 100); 15222#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15221#L10-2 assume !!(main_~i~0 < 100); 15220#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15219#L10-2 assume !!(main_~i~0 < 100); 15218#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15217#L10-2 assume !!(main_~i~0 < 100); 15216#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15215#L10-2 assume !!(main_~i~0 < 100); 15214#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15213#L10-2 assume !!(main_~i~0 < 100); 15212#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15211#L10-2 assume !!(main_~i~0 < 100); 15210#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15209#L10-2 assume !!(main_~i~0 < 100); 15208#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15207#L10-2 assume !!(main_~i~0 < 100); 15206#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15205#L10-2 assume !!(main_~i~0 < 100); 15204#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15203#L10-2 assume !!(main_~i~0 < 100); 15202#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15201#L10-2 assume !!(main_~i~0 < 100); 15200#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15199#L10-2 assume !!(main_~i~0 < 100); 15198#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15197#L10-2 assume !!(main_~i~0 < 100); 15196#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15195#L10-2 assume !!(main_~i~0 < 100); 15194#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15193#L10-2 assume !!(main_~i~0 < 100); 15192#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15191#L10-2 assume !!(main_~i~0 < 100); 15190#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15189#L10-2 assume !!(main_~i~0 < 100); 15188#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15187#L10-2 assume !!(main_~i~0 < 100); 15186#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15185#L10-2 assume !!(main_~i~0 < 100); 15184#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15183#L10-2 assume !!(main_~i~0 < 100); 15182#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15181#L10-2 assume !!(main_~i~0 < 100); 15180#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15179#L10-2 assume !!(main_~i~0 < 100); 15178#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15177#L10-2 assume !!(main_~i~0 < 100); 15176#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15175#L10-2 assume !!(main_~i~0 < 100); 15174#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15173#L10-2 assume !!(main_~i~0 < 100); 15172#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15171#L10-2 assume !!(main_~i~0 < 100); 15170#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15169#L10-2 assume !!(main_~i~0 < 100); 15168#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15167#L10-2 assume !!(main_~i~0 < 100); 15166#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15165#L10-2 assume !!(main_~i~0 < 100); 15164#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15163#L10-2 assume !!(main_~i~0 < 100); 15162#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15161#L10-2 assume !!(main_~i~0 < 100); 15160#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15159#L10-2 assume !!(main_~i~0 < 100); 15158#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15157#L10-2 assume !!(main_~i~0 < 100); 15156#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15155#L10-2 assume !!(main_~i~0 < 100); 15154#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15153#L10-2 assume !!(main_~i~0 < 100); 15152#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15151#L10-2 assume !!(main_~i~0 < 100); 15150#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15149#L10-2 assume !!(main_~i~0 < 100); 15148#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15147#L10-2 assume !!(main_~i~0 < 100); 15146#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15145#L10-2 assume !!(main_~i~0 < 100); 15144#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15143#L10-2 assume !!(main_~i~0 < 100); 15142#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15141#L10-2 assume !!(main_~i~0 < 100); 15140#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15139#L10-2 assume !!(main_~i~0 < 100); 15138#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15137#L10-2 assume !!(main_~i~0 < 100); 15136#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15135#L10-2 assume !!(main_~i~0 < 100); 15134#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15133#L10-2 assume !!(main_~i~0 < 100); 15131#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15130#L10-2 assume !!(main_~i~0 < 100); 15129#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15128#L10-2 assume !!(main_~i~0 < 100); 15120#L10 [2018-11-23 13:16:06,179 INFO L796 eck$LassoCheckResult]: Loop: 15120#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 15121#L10-2 assume !!(main_~i~0 < 100); 15129#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15128#L10-2 assume !!(main_~i~0 < 100); 15120#L10 [2018-11-23 13:16:06,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:06,180 INFO L82 PathProgramCache]: Analyzing trace with hash 844798583, now seen corresponding path program 49 times [2018-11-23 13:16:06,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:06,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:06,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:06,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:06,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:06,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:06,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 47 times [2018-11-23 13:16:06,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:06,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:06,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:06,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:06,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:06,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:06,201 INFO L82 PathProgramCache]: Analyzing trace with hash -166625361, now seen corresponding path program 49 times [2018-11-23 13:16:06,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:06,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:06,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:06,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:06,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 150 proven. 2450 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:06,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:06,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:06,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:06,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 150 proven. 2450 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:06,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:06,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-11-23 13:16:06,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 13:16:06,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 13:16:06,861 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. cyclomatic complexity: 3 Second operand 52 states. [2018-11-23 13:16:06,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:06,942 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-11-23 13:16:06,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 13:16:06,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 109 transitions. [2018-11-23 13:16:06,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:06,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 106 states and 108 transitions. [2018-11-23 13:16:06,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-23 13:16:06,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-23 13:16:06,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 108 transitions. [2018-11-23 13:16:06,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:16:06,944 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-11-23 13:16:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 108 transitions. [2018-11-23 13:16:06,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-23 13:16:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 13:16:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-11-23 13:16:06,945 INFO L728 BuchiCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-11-23 13:16:06,946 INFO L608 BuchiCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-11-23 13:16:06,946 INFO L442 BuchiCegarLoop]: ======== Iteration 52============ [2018-11-23 13:16:06,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 107 transitions. [2018-11-23 13:16:06,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:16:06,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:16:06,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:16:06,946 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [51, 50, 1] [2018-11-23 13:16:06,947 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 13:16:06,947 INFO L794 eck$LassoCheckResult]: Stem: 15700#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 15701#L10-2 assume !!(main_~i~0 < 100); 15702#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15703#L10-2 assume !!(main_~i~0 < 100); 15698#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15699#L10-2 assume !!(main_~i~0 < 100); 15800#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15799#L10-2 assume !!(main_~i~0 < 100); 15798#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15797#L10-2 assume !!(main_~i~0 < 100); 15796#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15795#L10-2 assume !!(main_~i~0 < 100); 15794#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15793#L10-2 assume !!(main_~i~0 < 100); 15792#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15791#L10-2 assume !!(main_~i~0 < 100); 15790#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15789#L10-2 assume !!(main_~i~0 < 100); 15788#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15787#L10-2 assume !!(main_~i~0 < 100); 15786#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15785#L10-2 assume !!(main_~i~0 < 100); 15784#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15783#L10-2 assume !!(main_~i~0 < 100); 15782#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15781#L10-2 assume !!(main_~i~0 < 100); 15780#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15779#L10-2 assume !!(main_~i~0 < 100); 15778#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15777#L10-2 assume !!(main_~i~0 < 100); 15776#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15775#L10-2 assume !!(main_~i~0 < 100); 15774#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15773#L10-2 assume !!(main_~i~0 < 100); 15772#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15771#L10-2 assume !!(main_~i~0 < 100); 15770#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15769#L10-2 assume !!(main_~i~0 < 100); 15768#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15767#L10-2 assume !!(main_~i~0 < 100); 15766#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15765#L10-2 assume !!(main_~i~0 < 100); 15764#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15763#L10-2 assume !!(main_~i~0 < 100); 15762#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15761#L10-2 assume !!(main_~i~0 < 100); 15760#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15759#L10-2 assume !!(main_~i~0 < 100); 15758#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15757#L10-2 assume !!(main_~i~0 < 100); 15756#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15755#L10-2 assume !!(main_~i~0 < 100); 15754#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15753#L10-2 assume !!(main_~i~0 < 100); 15752#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15751#L10-2 assume !!(main_~i~0 < 100); 15750#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15749#L10-2 assume !!(main_~i~0 < 100); 15748#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15747#L10-2 assume !!(main_~i~0 < 100); 15746#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15745#L10-2 assume !!(main_~i~0 < 100); 15744#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15743#L10-2 assume !!(main_~i~0 < 100); 15742#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15741#L10-2 assume !!(main_~i~0 < 100); 15740#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15739#L10-2 assume !!(main_~i~0 < 100); 15738#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15737#L10-2 assume !!(main_~i~0 < 100); 15736#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15735#L10-2 assume !!(main_~i~0 < 100); 15734#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15733#L10-2 assume !!(main_~i~0 < 100); 15732#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15731#L10-2 assume !!(main_~i~0 < 100); 15730#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15729#L10-2 assume !!(main_~i~0 < 100); 15728#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15727#L10-2 assume !!(main_~i~0 < 100); 15726#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15725#L10-2 assume !!(main_~i~0 < 100); 15724#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15723#L10-2 assume !!(main_~i~0 < 100); 15722#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15721#L10-2 assume !!(main_~i~0 < 100); 15720#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15719#L10-2 assume !!(main_~i~0 < 100); 15718#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15717#L10-2 assume !!(main_~i~0 < 100); 15716#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15715#L10-2 assume !!(main_~i~0 < 100); 15714#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15713#L10-2 assume !!(main_~i~0 < 100); 15712#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15711#L10-2 assume !!(main_~i~0 < 100); 15710#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15709#L10-2 assume !!(main_~i~0 < 100); 15707#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15706#L10-2 assume !!(main_~i~0 < 100); 15705#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15704#L10-2 assume !!(main_~i~0 < 100); 15696#L10 [2018-11-23 13:16:06,947 INFO L796 eck$LassoCheckResult]: Loop: 15696#L10 assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; 15697#L10-2 assume !!(main_~i~0 < 100); 15705#L10 assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; 15704#L10-2 assume !!(main_~i~0 < 100); 15696#L10 [2018-11-23 13:16:06,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:06,947 INFO L82 PathProgramCache]: Analyzing trace with hash 102619732, now seen corresponding path program 50 times [2018-11-23 13:16:06,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:06,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:06,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:06,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:06,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:06,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:06,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 48 times [2018-11-23 13:16:06,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:06,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:06,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:06,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:06,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:06,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:06,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1270380276, now seen corresponding path program 50 times [2018-11-23 13:16:06,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:06,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:06,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:06,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:06,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:07,624 WARN L180 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 155 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := ~i~0 - 1; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := ~i~0 - 1; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 ----- [2018-11-23 13:16:07,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:16:07 BoogieIcfgContainer [2018-11-23 13:16:07,663 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:16:07,663 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:16:07,663 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:16:07,663 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:16:07,664 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:47" (3/4) ... [2018-11-23 13:16:07,666 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := ~i~0 - 1; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := ~i~0 - 1; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 ----- [2018-11-23 13:16:08,519 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9282e44b-c7f4-4103-b674-f5685fcf98ad/bin-2019/uautomizer/witness.graphml [2018-11-23 13:16:08,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:16:08,520 INFO L168 Benchmark]: Toolchain (without parser) took 21488.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 371.2 MB). Free memory was 959.2 MB in the beginning and 972.0 MB in the end (delta: -12.7 MB). Peak memory consumption was 358.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:08,520 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:16:08,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.81 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:08,521 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.45 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:16:08,521 INFO L168 Benchmark]: Boogie Preprocessor took 9.94 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:08,521 INFO L168 Benchmark]: RCFGBuilder took 141.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:08,544 INFO L168 Benchmark]: BuchiAutomizer took 20311.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.1 GB in the beginning and 972.0 MB in the end (delta: 151.2 MB). Peak memory consumption was 387.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:16:08,544 INFO L168 Benchmark]: Witness Printer took 856.20 ms. Allocated memory is still 1.4 GB. Free memory was 972.0 MB in the beginning and 972.0 MB in the end (delta: 48 B). Peak memory consumption was 48 B. Max. memory is 11.5 GB. [2018-11-23 13:16:08,546 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 146.81 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.45 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.94 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 141.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20311.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.1 GB in the beginning and 972.0 MB in the end (delta: 151.2 MB). Peak memory consumption was 387.7 MB. Max. memory is 11.5 GB. * Witness Printer took 856.20 ms. Allocated memory is still 1.4 GB. Free memory was 972.0 MB in the beginning and 972.0 MB in the end (delta: 48 B). Peak memory consumption was 48 B. 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 54 terminating modules (50 trivial, 2 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * i + 99 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 99 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 99 and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. 50 modules have a trivial ranking function, the largest among these consists of 52 locations. The remainder module has 105 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.2s and 52 iterations. TraceHistogramMax:51. Analysis of lassos took 17.5s. Construction of modules took 1.4s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 54. Automata minimization 0.0s AutomataMinimizationTime, 54 MinimizatonAttempts, 58 StatesRemovedByMinimization, 52 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 105 states and ocurred in iteration 51. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 128 SDtfs, 29 SDslu, 3 SDs, 0 SdLazy, 3542 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc47 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax211 hnf99 lsp47 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf112 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 10]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result=0, i=50} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 10]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := ~i~0 - 1; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := ~i~0 - 1; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(main_~i~0 < 50);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 1 + main_~i~0; [?] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] assume !!(main_~i~0 < 100); [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := main_~i~0 - 1; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 1 + main_~i~0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := ~i~0 - 1; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := ~i~0 - 1; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 1 + ~i~0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 Loop: [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...